On montgomery-like representations for elliptic curves over GF(2k)

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

Volumn 2567, Issue , 2003, Pages 240-253

  Stam, Martijn ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

ECC; Lucas chains; Montgomery; Point multiplication

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; GEOMETRY;

BINARY FIELDS; DOUBLE-EXPONENTIATION; ELLIPTIC CURVE; MONTGOMERY; NON-CONSTRAINED; NON-SUPERSINGULAR; POINT MULTIPLICATION; PROJECTIVE METHODS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 35248900879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36288-6_18     Document Type: Article

References (30)

1. 2155. IEEE J-SAC, 11(5):804-813, 1993.
2. T. Akishita. Fast simultaneous scalar multiplication on elliptic curve with Montgomery form. SAC'01, LNCS 2259, pages 255-268.
3. D. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, 14(3):153-176, 2001.
4. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999.
5. D. Bleichenbacher. Efficiency and Security of Cryptosystems based on Number Theory. PhD thesis, ETH Zürich, 1996.
6. E. Brier and M. Joye. Weierstraß elliptic curves and side-channel attacks. PKC'02, LNCS 2274, pages 335-345.
7. H. Cohen, A. Miyaji, and T. Ono. Efficient elliptic curve exponentiation using mixed coordinates. Asiacrypt'98, LNCS 1514, pages 51-65.
8. D. Hankerson, J. López Hernandez, and A. Menezes. Software implementation of elliptic curve cryptography over binary fields. CHES'00, LNCS 1965, pages 1-24.
9. T. Izu and T. Takagi. A fast parallel elliptic curve multiplication resistant against side channel attacks. PKC'02, LNCS 2274, pages 280-296.
10. D. Johnson and A. Menezes. The elliptic curve digital signature algorithm (ECDSA). CACR Technical report CORR 99-31, University of Waterloo, 1999.
11. n) when using projective point arithmetic. SAC'01, LNCS 2259, pages 134-150.
12. D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison Wesley, 3 edition, 1997.
13. D. E. Knuth, editor. Selected papers on analysis of algorithms. CSLI Publications, Stanford, 2000.
14. D. E. Knuth and C. H. Papadimitriou. Duality in addition chains. Bull. Eur. Assoc. Theor. Comput. Sci EATCS, 13:2-4, 1981. Reprinted in [13, Chapter 31].
15. D. H. Lehmer. Computer technology applied to the theory of numbers. Studies in Number Theory, volume 6 of MAA Studies in Mathematics, pages 117-151, 1969.
16. m). SAC'98, LNCS 1556, pages 201-212.
17. m) without precomputation. CHES'99, LNCS 1717, pages 316-327.
18. A. J. Menezes and S. A. Vanstone. Elliptic curve cryptosystems and their implementation. Journal of Cryptology, 6(4):209-224, 1993.
19. B. Möller. Algorithms for multi-exponentiation. SAC'01, LNCS 2259, pages 165-180.
20. m-n) via Lucas chains. Available from ftp.cwi.nl: /pub/pmontgom/Lucas.ps.gz, 1983.
21. P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(170):243-264, 1987.
22. P. L. Montgomery, Aug. 2000. Private communication: expon2.txt, Dual elliptic curve exponentiation.
23. National Institute of Standards and Technology. Digital Signature Standard, 2000. FIPS Publication 186-2.
24. K. Okeya, H. Kurumatani, and K. Sakurai. Elliptic curves with the Montgomery-form and their cryptographic applications. PKC'00, LNCS 1751, pages 238-257.
25. K. Okeya and K. Sakurai. Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve. CHES'01, LNCS 2162, pages 126-141.
26. B. Schoenmakers, Aug. 2000. Personal communication.
27. M. Stam and A. K. Lenstra. Speeding up XTR. Asiacrypt'01, LNCS 2248, pages 125-143.
28. E. G. Straus. Problems and solutions: (5125) addition chains of vectors. American Mathematical Monthly, 71:806-808, 1964.
29. Y. Tsuruoka. Computing short Lucas chains for elliptic curve cryptosystems. IEICE Trans. Fundamentals, E84-A(5):1227-1233, 2001.
30. S. A. Vanstone, R. C. Mullin, A. Antipa, and R. Gallant. Accelerated finite field operations on an elliptic curve. WO 99/49386, Patent Cooperation Treaty, 1999.