Fast elliptic curve algorithm combining frobenius map and table reference to adapt to higher characteristic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1592, Issue , 1999, Pages 176-189

  Kobayashi, Tetsutaro ^a   Morita, Hikaru ^a   Kobayashi, Kunio ^a   Hoshino, Fumitaka ^a  

^a NTT CORPORATION   (Japan)

Author keywords

Elliptic curve cryptosystem; Finite field; Frobenius map; OEF; Scalar multiplication; Table reference method

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; GEOMETRY;

COMPUTATIONAL UNITS; EFICIENCY; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEM; FINITE FIELDS; REFERENCE METHOD; SCALAR MULTIPLICATION;

ALGORITHMS;

EID: 84957693621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_13     Document Type: Conference Paper

References (12)

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. V. Müller, “Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two," Journal of Cryptology(1998) 11, pp.219-234, 1998.
8. J. H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, New York, 1986.
9. R. Mullin, I. Onyszchuk, S. Vanstone, and R. Wilson, “Optimal Normal Basis in GF(pn)," Discrete Applied Mathematics, 22:149-161, 1988.
10. 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.
11. 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.
12. 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.