Faster scalar multiplication on koblitz curves combining point halving with the frobenius endomorphism

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

Volumn 2947, Issue , 2004, Pages 28-40

  Avanzi, Roberto Maria ^a   Ciet, Mathieu ^b   Sica, Francesco ^c  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

^b INNOVA CARD   (France)

^c MOUNT ALLISON UNIVERSITY   (Canada)

Author keywords

Integer decomposition; Koblitz curves; Point halving; Scalar multiplication; adic expansion

Indexed keywords

ALGORITHMS; PUBLIC KEY CRYPTOGRAPHY;

FIELD EXTENSIONS; FROBENIUS METHOD; INVERSE OPERATION; KOBLITZ CURVES; POINT DOUBLINGS; POINT HALVING; PRE-COMPUTATION; SCALAR MULTIPLICATION;

INVERSE PROBLEMS;

EID: 26444444315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24632-9_3     Document Type: Article

References (18)

1. D.W. Ash, I.F. Blake and S. Vanstone. Low complexity normal bases. Discrete Applied Math. 25 (1989), pp. 191-210.
2. R. M. Avanzi. On the complexity of certain multi-exponentiation techniques in cryptography. To appear in Journal of Cryptology.
3. K. Fong, D. Hankerson, J. Lopez and A. Menezes. Field inversion and point halving revisited. Available fromhttp:/7www.cs.siu.edu/~kfong/research/ ECCpaper.ps, Unpublished Manuscript.
4. D. Hankerson, J. Lopez-Hernandez, and A. Menezes. Software Implementatin of Elliptic Curve Cryprography over Binary Fields. In: Proceedings of CUES 2000. LNCS 1965, pp. 1-24. Springer, 2001.
5. E. W. Knudsen. Elliptic Scalar Multiplication Using Point Halving. In: Proocedings of ASIACRYPT 1999, LNCS 1716, pp. 135-149. Springer, 1999.
6. D.E. Knuth. The Art of Computer Programming. Addison-Wesley, 1999. 3rd ed.
7. N. Koblitz. Elliptic curve cryptosystems. Mathematics of computation 48 (1987), pp. 203-209.
8. N. Koblitz. CM-curves with good cryptographic properties. In: Proceedings of CRYPTO 1991, LNCS 576, pp. 279-287. Springer, 1991.
9. V.S. Miller. Use of elliptic curves in cryptography. In: Proceedings of CRYPTO '85. LNCS 218, pp. 417-426. Springer, 1986.
10. J. Pelzl, T. Wollinger, J. Guajardo and C. Paar. Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves. In: Proceedings of CHES 2003. LNCS 2779, pp. 351-365. Springer 2003.
11. G. W. Reitwiesner. Binary arithmetic. Advances in Computers, 1:231-308, 1960.
12. R. Schroeppel. Point halving wins big. Talks at: (i) Midwest Arithmetical Geometry in Cryptography Workshop, November 17-19, 2000, University of Illinois at Urbana-Champaign; and (ii) ECC 2001 Workshop, October 29-31, 2001, University of Waterloo, Ontario, Canada.
13. R. Schroeppel. Elliptic curve point ambiguity resolution apparatus and method. International Application Number PCT/US00/31014, filed 9 November 2000.
14. J. A. Solinas. An improved algorithm for arithmetic on a family of elliptic curves. In: Proceedings of CRYPTO 1997, LNCS 1294, pp. 357-371. Springer, 1997.
15. J.A. Solinas. Efficient Arithmetic on Koblitz Curves. Designs, Codes and Cryptography, Vol. 19 (2000), No. 2/3, pp. 125-179.
16. E. G. Straus, Addition chains of vectors (problem 5125). American Mathematical Monthly, vol. 71, 1964, pp. 806-808.
17. IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society, August 29, 2000.
18. National Institute of Standards and Technology. Digital Signature Standard. FIPS Publication 186-2, February 2000.