Fast Implementation for Modular Inversion and Scalar Multiplication in the Elliptic Curve Cryptography

Author

Ma, Shiwei ; Hao, Yuanling ; Pan, Zhongqiao ; Chen, Hui

Author_Institution

Sch. of Mechatron. Eng. & Autom., Shanghai Univ., Shanghai

Volume

2

fYear

2008

fDate

20-22 Dec. 2008

Firstpage

488

Lastpage

492

Abstract

Modular inversion and Scalar multiplication are the kernel for computations in the GF(p) used by many public-key cryptosystem in data security systems. Various algorithms have been used for both software and hardware implementation of GF (p) inversion, but its application is limited because of the constraint of its speed. In this paper, a fast GF(p) inversion algorithm is proposed which can be used in both software and hardware realizations and is particularly suitable for VLSI implementations. Also an efficient algorithm for scalar multiplication in ECC is discussed and the corresponding comparative results are given. The results of numerical tests and performance comparisons manifests that the proposed algorithms can remarkably improve the computational efficiency. Hence, it has practical significance for the implementation of ECC and is expected to be applied to data security.

Keywords

Galois fields; VLSI; public key cryptography; GF(p) modular inversion algorithm; VLSI implementation; data security; elliptic curve cryptography; hardware implementation; public-key cryptosystem; scalar multiplication; software implementation; Application software; Computational efficiency; Data security; Elliptic curve cryptography; Hardware; Kernel; Public key cryptography; Software algorithms; Testing; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Information Technology Application, 2008. IITA '08. Second International Symposium on

Conference_Location

Shanghai

Print_ISBN

978-0-7695-3497-8

Type

conf

DOI

10.1109/IITA.2008.392

Filename

4739812