Abstract
A new elliptic curve scalar multiplication algorithm is proposed. The algorithm offers about twice the troughput of some conventional OEF-base algorithms because it combines the Frobenius map with the table reference method based on base-φ expansion. Furthermore, since this algorithm suits conventional computational units such as 16, 32 and 64 bits, its base field \( F_{p^m } \) is expected to enhance elliptic curve operation efficiency more than F q (q is a prime) or \( F_{2^n } \) .
Chapter PDF
Keywords
References
D. V. Bailey and C. Paar, “Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms,” Advances in Cryptology — CRYPTO’ 98, Lecture Notes in Computer Science 1462, pp.472–485, Springer, 1998.
N. Koblitz, “CM-Curves with Good Cryptographic Properties,” Advances in Cryptology — CRYPTO’91, Lecture Notes in Computer Science 576, pp.279–287, Springer-Verlag, 1992.
N. Koblitz, “An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm,” Advances in Cryptology — CRYPTO’98, Lecture Notes in Computer Science 1462, pp.327–337, Springer-Verlag, 1998.
J. A. Solinas “An Improved Algorithm for Arithmetic on a Family of Elliptic Curves,” Advances in Cryptology — CRYPTO’97, Lecture Notes in Computer Science 1294, pp.357–371, Springer, 1997.
J. H. Cheon, S. Park and S. Park, D. Kim, “Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map,” Public Key Cryptography: Proceedings of the First international workshop, PKC’ 98, Lecture Notes in Computer Science 1431, pp.195–202, Springer, 1998.
E. F. Brickell, D. M. Gordon, K. S. McCurley and D. B. Wilson, “Fast Exponentiation with Precomputation,” Advances in Cryptology — EUROCRYPT’92, Lecture Notes in Computer Science 658, pp.200–207, Springer, 1993.
V. Müller, “Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two,” Journal of Cryptology (1998) 11, pp.219–234, 1998.
J. H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, New York, 1986.
R. Mullin, I. Onyszchuk, S. Vanstone, and R. Wilson, “Optimal Normal Basis in GF(pn),” Discrete Applied Mathematics, 22:149–161, 1988.
M. J. Wiener and R. J. Zuccherato, “Faster Attacks on Elliptic Curve Cryptosystems,” Fifth Annual Workshop on Selected Areas in Cryptography — SAC’98 pp.196–207, Workshop Record, 1998.
H. Cohen, A. Miyaji and T. Ono, “Efficient Elliptic Curve Exponentiation Using Mixed Coordinates,” Advances in Cryptology — ASIACRYPT’98, Lecture Notes in Computer Science 1514, pp.51–65, Springer-Verlag, 1998.
E. De Win, A. Bosselaers and S. Vandenberghe, “A Fast Software Implementation for Arithmetic Operations in GF(2n),” Advances in Cryptology — ASIACRYPT’96, Lecture Notes in Computer Science 1163, pp.65–76, Springer-Verlag, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kobayashi, T., Morita, H., Kobayashi, K., Hoshino, F. (1999). Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic. In: Stern, J. (eds) Advances in Cryptology — EUROCRYPT ’99. EUROCRYPT 1999. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48910-X_13
Download citation
DOI: https://doi.org/10.1007/3-540-48910-X_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65889-4
Online ISBN: 978-3-540-48910-8
eBook Packages: Springer Book Archive