A scalar multiplication algorithm with recovery of the y-coordinate on the montgomery form and analysis of efficiency for elliptic curve cryptosystems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E85-A, Issue 1, 2002, Pages 84-93

  Okeya, Katsuyuki ^a   Sakurai, Kouichi ^b  

^a HITACHI LTD   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Elliptic curve cryptosystem; Fast scalar multiplication; Montgomery form; Y coordinate recovery

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBLEM SOLVING; SMART CARDS;

SCALAR MULTIPLICATIONS;

CRYPTOGRAPHY;

EID: 0036454692     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (27)

1. 135," IEEE J. Sel. Areas Commun., vol.11, no.5, pp.804-813, 1993.
2. ANSI X9.62, "Public key cryptography for the financial services industry," The Elliptic Curve Digital Signature Algorithm(ECDSA), 1999.
3. D.V. Bailey and C. Paar, "Optimal extension fields for fast arithmetic in public-key algorithms," Advances in Cryptology-CRYPTO'98, LNCS1462, pp.472-485, 1998.
4. D.V. Bailey and C. Paar, "Inversion in optimal extension fields," Conference on The Mathematics of Public Key Cryptography, 1999.
5. I.F. Blake, G. Seroussi, and N.P. Smart, Elliptic Curves in Cryptography, Cambridge University Press, 1999.
6. H. Cohen, A. Miyaji, and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates," Advances in Cryptology-ASIACRYPT'98, LNCS1514, pp.51-65, 1998.
7. H. Cohen, A course in computational algebraic number theory, GTM138, Springer-Verlag, New York, 1993.
8. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Inf. Theory, vol.31, no.4, pp.469-472, 1985.
9. A. Enge, Elliptic Curves and their applications to Cryptography, Kluwer Academic Publishers, 1999.
10. D. Hankerson, J.L. Hernandez, and A. Menezes, "Software implementation of elliptic curve cryptography over binary fields," Pre-Proceedings of Workshop on Cryptographic Hardware and Embedded Systems (CHES2000), pp.1-24, 2000.
11. IEEE P1363 Standard Specifications for Public-Key Cryptography, 1999, Available at http://grouper.ieee.org/groups/1363/.
12. N. Koblitz, "Elliptic curve cryptosystems," Math. Comp., vol.48, pp.203-209, 1987.
13. C. Kocher, "Cryptanalysis of Diffie-Hellman, RSA, DSS, and other systems using timing attacks," Available at http://www.cryptography.com/.
14. C. Kocher, "Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems," Advances in Cryptology-CRYPTO'96, LNCS1109, pp.104-113, 1996.
15. m) without precomputation," Cryptographic Hardware and Embedded Systems (CHES'99), LNCS1717, pp.316-327; 1999.
16. m)," Proc. PKC'00 LNCS1751, pp.405-421, 2000.
17. C. Lira and P. Lee, "More flexible exponentiation with precomputation," Advances in Cryptology-CRYPTO'94, LNCS839, pp.95-107, 1994.
18. A.K. Lenstra and E.R. Verheul, "Selecting cryptographic key sizes," Proc. PKC'00 LNCS1751, pp.446-465, 2000.
19. V.S. Miller, "Use of elliptic curves in cryptography," Advances in Cryptology-CRYPTO'85, LNCS218, pp.417426, 1986.
20. P.L. Montgomery, "Speeding the pollard and elliptic curve methods of factorizations," Math. Comp. 48, pp.243-264, 1987.
21. m-n) via Lucas chains, 1992.
22. K. Ohgishi, R. Sakai, and M. Kasahara, "Elliptic curve signature scheme with no y coordinate," Proc. SCIS'99, W4-1.3, pp.285-287, 1999.
23. K. Okeya, H. Kurumatani, and K. Sakurai, "Elliptic curves with the Montgomery-form and their cryptographic applications," Public Key Cryptography (PKC2000), LNCS1751, pp.238-257, 2000.
24. K. Okeya and K. Sakurai, "Power analysis breaks elliptic curve cryptosystems even secure against the timing attack," Progress in Cryptology-INDOCRYPT 2000, LNCS1977, pp.178-190, 2000.
25. Standards for Efficient Cryptography, Elliptic Curve Cryptography Ver.1.0, 2000, Available at http://www.secg.org/secg_docs.htm.
26. Y. Turuoka, K. Takeuchi, and K. Koyama, "Computing short Lucas chains for ECC," SCIS2000-B07, 2000.
27. S.A. Vanstone, "Accelerated finite field operations on an elliptic curve," GB patent, Application number GB9713138.7 (Date Lodged, 20.06.1997).