International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 163 - Issue 2 |
Published: Apr 2017 |
Authors: S. Revathi, A. R. Rishivarman |
![]() |
S. Revathi, A. R. Rishivarman . An Improved Scalar Multiplication Over GF(2m) for ECC. International Journal of Computer Applications. 163, 2 (Apr 2017), 13-17. DOI=10.5120/ijca2017913469
@article{ 10.5120/ijca2017913469, author = { S. Revathi,A. R. Rishivarman }, title = { An Improved Scalar Multiplication Over GF(2m) for ECC }, journal = { International Journal of Computer Applications }, year = { 2017 }, volume = { 163 }, number = { 2 }, pages = { 13-17 }, doi = { 10.5120/ijca2017913469 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2017 %A S. Revathi %A A. R. Rishivarman %T An Improved Scalar Multiplication Over GF(2m) for ECC%T %J International Journal of Computer Applications %V 163 %N 2 %P 13-17 %R 10.5120/ijca2017913469 %I Foundation of Computer Science (FCS), NY, USA
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 public – key systems provide relatively small block size, high speed, and high security. This paper identified an efficient performance of concurrent algorithm using complementary recoding over