Referenced Items are not available for this document.
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
- Page(s):
- 1055 - 1059
- Print ISBN:
- 0-7803-9068-7
- INSPEC Accession Number:
- 8670640
- Digital Object Identifier :
- 10.1109/WCACEM.2005.1469764
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
