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

Authors:
Shiwei Ma;Yuanling Hao;Zhongqiao Pan;Hui Chen
Affiliations:
-;-;-;-
Venue:
IITA '08 Proceedings of the 2008 Second International Symposium on Intelligent Information Technology Application - Volume 02
Year:
2008

Citing 0
Cited 3

Analysis of ECDSA authentication processing in VANETs

NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Sensor networks with secure public-key over GF (2m)

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology

Quantified Score

Hi-index	0.00

Visualization

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.