Abstract
The Frobenius endomorphism is known to be useful in efficient implementation of multiplication on certain elliptic curves. In this note a method to minimize the length of the Frobenius expansion of integer multiplier, ellipticc urves defined over small finite fields, is introduced. It is an optimization of previous works by Solinas and Müller. Finally, experimental results are presented and compared with curves recommended in standards by time-performance of multiplication.
This work was supported by grant RND project 2001-S-092 of KISA
This work was supported by grant No. 1999-10300-001-2 from the BasicResearc h Program of the Korea Science & Engineering Foundation.
Chapter PDF
Similar content being viewed by others
References
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.
P. Gaudry, F. Hess and N. Smart, “Constructive and destructive facets of Weil descent on elliptic curves”, to appear J. Cryptology.
R. Gallant, R. Lambert, and S. Vanstone, “Improving the parallelized Pollard lambda search on binary anomalous curves”, Math. of Com., 69 (2000), 1699–1705.
N. Koblitz, “CM-curves with good cryptographic properties”, In Advances in Cryptology, CRYPTO 91, LNCS 576, Springer-Verlag (1992), 279–287.
W. Meier, O. Staffelbach, “Efficient multiplication on certain nonsupersingular elliptic curves”, Advances in Cryptology, Crypto’92, 333–344.
V. Müller, “Fast multiplication on elliptic curves over small fields of characteristic two”, Journal of Cryptology, 11 (1998), 219–234.
D. Shanks, “Five number theoretic algorithms” In Proc. 2nd Manitoba Conference on Numerical Mathematics (1972), 51–70.
N.P. Smart, “Elliptic curve cryptosystems over small fields of odd characteristic”, Journal of Cryptology, 12 (1998), 141–151.
J. Solinas, “Efficient arithmetic on Koblitz curves”, Design, Codes and Cryptography, 19 (2000), 195–249.
I. Stewart, D. Tall, “Algebraic Number Theory”, Chapman and Hall, Halsted Press, 1979.
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.
M. Wiener and R. Zuccherato, ‘Faster Attacks on Elliptic Curve Cryptosystems’, contribution to IEEE P1363.
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., Oh, S., Lee, S., Lim, J., Sung, M. (2002). An Improved Method of 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_22
Download citation
DOI: https://doi.org/10.1007/3-540-45664-3_22
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