An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves

  • Authors:
  • Young-Ho Park;Sangtae Jeong;Chang Han Kim;Jongin Lim

  • Affiliations:
  • -;-;-;-

  • Venue:
  • PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper the Gallant-Lambert-Vanstone method is reexamined for speeding up scalar multiplication. Using the theory of 碌-Euclidian algorithm, we provide a rigorous method to reduce the theoretical bound for the decomposition of an integer k in the endomorphism ring of an elliptic curve. We then compare the two different methods for decomposition through computational implementations.