Optimal implementation of elliptic curve cryptography
- Resource Type
- Conference
- Authors
- Lv, Hongqiang; Li, Hui; Yi, Junkai; Lu, Hao
- Source
- Proceedings of 2013 IEEE International Conference on Service Operations and Logistics, and Informatics Service Operations and Logistics, and Informatics (SOLI), 2013 IEEE International Conference on. :35-39 Jul, 2013
- Subject
- Communication, Networking and Broadcast Technologies
Computing and Processing
Engineering Profession
Power, Energy and Industry Applications
Elliptic curve cryptography
Elliptic curves
Encryption
Safety
Optimization
Elliptic Curve Cryptography
scalar multiplication
optimal algorithm
random number
- Language
The most time-consuming operation in the Elliptic Curve Cryptography (ECC) calculation is scalar multiplication. Scalar multiplication plays a major role in ECC. Currently, there are several optimization algorithms for point scalar multiplication which have either high computational complexity or additional storage requirement. They are all unsuitable for further applying. In this paper, we present a new compatible optimal algorithm which improves the efficiency by generating a special random number k as the scalar. The experimental results show that the processes of encryption and decryption have been speed up significantly in the same condition.