Call for Paper - January 2024 Edition
IJCA solicits original research papers for the January 2024 Edition. Last date of manuscript submission is December 20, 2023. Read More

An Improved Scalar Multiplication Over GF(2<sup>m</sup>) for ECC

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2017
S. Revathi, A. R. Rishivarman

S Revathi and A R Rishivarman. An Improved Scalar Multiplication Over GF(2m) for ECC. International Journal of Computer Applications 163(2):13-17, April 2017. BibTeX

	author = {S. Revathi and A. R. Rishivarman},
	title = {An Improved Scalar Multiplication Over GF(2m) for ECC},
	journal = {International Journal of Computer Applications},
	issue_date = {April 2017},
	volume = {163},
	number = {2},
	month = {Apr},
	year = {2017},
	issn = {0975-8887},
	pages = {13-17},
	numpages = {5},
	url = {},
	doi = {10.5120/ijca2017913469},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, 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


  1. Blake, I., Seroussi, G., and Smart, N. Press, 1999. “Elliptic Curves in Cryptography, Cambridge University”.
  2. Buhler, P., Lenstra, H.W., and Pomerance, C. “The development of the number field sieve”, lecture Notes in Computer Science, volume- 1554, Springer-Verlag, 1994.
  3. W.Diffie and M.E.Hellman. 1976, “New directions in cryptography,” IEEE Trans. On Information Theory, IT-22, (644-654).
  4. D.M.Gordon, 1998 “A Survey of fast exponention methods,” J. Algorithms, 27, (129-146).
  5. Han, Y., leong, P., Tan, P., and Zhang, J “Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field,” Advances in Cryptology-CRYPTO 1999. LNCS 1716, (75-85).
  6. Guajardo, J. and Paar, C. “Efficient Algorithms for Elliptic Curve Cryptosystems,” Advances in Cryptology-CYYPTO 1997.LNCS 1462, (342-356).
  7. Itoh, T. and Tsujii, S. 1988, “A fast Algorithm for Computing Multiplication inverses in


Secret sharing, Elliptic Curve Cryptography (ECC),