DocumentCode
3550363
Title
Fast arithmetic of elliptic curve cryptosystem in mobile communication
Author
Ya-Lin, Miao ; Liang, Zhang ; Zheng-Zhong, Bian ; Ying-Chun, Gao
Author_Institution
Xi´´an Jiaotong Univ., China
fYear
2005
fDate
3-7 April 2005
Firstpage
1055
Lastpage
1059
Abstract
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.
Keywords
Galois fields; mobile communication; public key cryptography; telecommunication security; elliptic curve cryptosystem; elliptic curve discrete logarithm problem; finite field GF; mobile communication; public key encryption; security solution; Arithmetic; Communication system security; Data security; Elliptic curve cryptography; Elliptic curves; Galois fields; Information security; Military communication; Mobile communication; Public key;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Applied Computational Electromagnetics, 2005. IEEE/ACES International Conference on
Print_ISBN
0-7803-9068-7
Type
conf
DOI
10.1109/WCACEM.2005.1469764
Filename
1469764
Link To Document