Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Fast arithmetic of elliptic curve cryptosystem in mobile communication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Miao Ya-lin ; Xi''an Jiaotong Univ., China ; Zhang Liang ; Bian Zheng-Zhong ; Gao Ying-Chun

Using the elliptic curve discrete logarithm problem, a security solution for mobile communication was built and one digital module of elliptic curve cryptosystem (ECC) was given in this paper. The solution had achieved rapid arithmetic correlated with ECC in finite field GF(p). The security of 160 bit-ECC-key corresponded 1000 bit-key in RSA. Furthermore, the arithmetic efficiency of addition and subtraction put forwards in other field was 20%-40% quicker than common.

Published in:

Wireless Communications and Applied Computational Electromagnetics, 2005. IEEE/ACES International Conference on

Date of Conference:

3-7 April 2005