Optimal implementation of elliptic curve cryptography

Author

Hongqiang Lv ; Hui Li ; Junkai Yi ; Hao Lu

Author_Institution

Coll. of Inf. Sci. & Technol., Beijing Univ. of Chem. Technol., Beijing, China

fYear

2013

fDate

28-30 July 2013

Firstpage

35

Lastpage

39

Abstract

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.

Keywords

computational complexity; optimisation; public key cryptography; random number generation; computational complexity; decryption process; elliptic curve cryptography; encryption process; optimization algorithm; point scalar multiplication; special random number generation; Elliptic curve cryptography; Elliptic curves; Encryption; Optimization; Safety; Elliptic Curve Cryptography; optimal algorithm; random number; scalar multiplication;

fLanguage

English

Publisher

ieee

Conference_Titel

Service Operations and Logistics, and Informatics (SOLI), 2013 IEEE International Conference on

Conference_Location

Dongguan

Print_ISBN

978-1-4799-0529-4

Type

conf

DOI

10.1109/SOLI.2013.6611377

Filename

6611377