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.
Chapter PDF
Similar content being viewed by others
References
Ian Blake, Gadiel Seroussi and Nigel Smart, ‘Elliptic Curves in Cryptography’, London Mathematical Society Lecture Note Series. 265, Cambridge University Press, (1999).
G. Cornacchia, “Su di un metodo per la risoluzione in numeri interi dell’ equazione Σ n h =0C h x n−h y h = P”, Giornale di Matematiche di Battaglini, 46, (1908),33–90.
R. Gallant, R. Lambert and S. Vanstone, “Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms”, Advances in Cryptology-Crypto 2001, LNCS 2139, Springer-Verlag (2001), 190–200.
K. Ireland and M. Rosen, ‘A classical introduction to modern number theory’, Graduate Texts in Mathematics, vol 84, Springer-Verlag, (1982).
N. Koblitz, “CM-curves with good cryptographic properties”, Advances in Cryptology-Crypto’ 91, LNCS 576, Springer-Verlag (1992), 279–287.
V. Müller,“ Fast multiplication in elliptic curves over small fields of characteristic two”, Journal of Cryptology, 11 (1998), 219–234.
W. Meier and O. Staffelbach, “Efficient multiplication on certain nonsupersingular elliptic curves”, Advances in Cryptology-Crypto’92, Springer-Verlag (1992), 333–344.
S. Pohlig, M. Hellman,“An improved algorithm for computing logarithms over GF(p) its cryptographic significance,”, IEEE Trans. Inform. Theory, 24 (1978), 106–110.
D. Shanks, “Five number theoretic algorithms” In Proc. 2nd Manitoba Conference on Numerical Mathematics (1972), 51–70.
B. Vallée,“Une approche géométrique des algorithmes de réduction des réseaux en petite dimension”, (1986) Thése, Université de Caen.
N. Smart, “Elliptic curve cryptosystems over small fields of odd characteristic”, Journal of Cryptology, 12 (1999), 141–145.
J. Solinas, “An improved algorithm for arithmetic on a familyof elliptic curves”, Advances in Cryptology-Crypto’ 97, LNCS 1294, Springer-Verlag (1997), 357–371.
J. Solinas, “Efficient arithmetic on Koblitz curves”, Design, Codes and Cryptography, 19 (2000), 195–249.
I. Stewart and D. Tall, “Algebraic Number Theory”, Chapman and Hall, Halsted Press, (1979).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, YH., Jeong, S., Kim, C.H., Lim, J. (2002). An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves. In: Naccache, D., Paillier, P. (eds) Public Key Cryptography. PKC 2002. Lecture Notes in Computer Science, vol 2274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45664-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-45664-3_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43168-8
Online ISBN: 978-3-540-45664-3
eBook Packages: Springer Book Archive