An Improved Scalar Multiplication Over GF(2m) for ECC
S. Revathi, A. R. · International Journal of Computer Applications · 2017
Since the introduction of public-key cryptography by Diffe and Hellman in 1976, the potential for the use of the discrete logarithm problem in public-key cryptosystems has been recognized.Although the discrete logarithm problem as first employed by Diffe and Hellman was defined explicitly as the problem of finding logarithms with respect to a generator in the multiplicative group of the integers module a prime, this idea can be extended to arbitrary groups and in particular, to elliptic curve groups.The resulting publickey systems provide relatively small block size, high speed, and high security.This paper identified an efficient performance of concurrent algorithm using complementary recoding over 𝐺𝐹(2 𝑚 ) for scalar multiplication in the polynomial basis (PB) to use in an elliptic curve cryptosystems, which enhances security.So this scheme is of less computation cost which is valuable in applications with limited memory, communications bandwidth or computing power.