Trading inversions for multiplications in elliptic curve cryptography

Designs, Codes, and Cryptography

Volumn 39, Issue 2, 2006, Pages 189-206

  Ciet, Mathieu ^a   Joye, Marc ^b   Lauter, Kristin ^c   Montgomery, Peter L ^c  

^a GEMPLUS   (France)

^b CIM PACA   (France)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Affine coordinates; Cryptography; Elliptic curves; Fast arithmetic; Radix r decompositions

Indexed keywords

CODES (SYMBOLS); CURVE FITTING; NUMERICAL METHODS;

AFFINE COORDINATES; ELLIPTIC CURVES; FAST ARITHMETIC; RADIX-R DECOMPOSITIONS;

CRYPTOGRAPHY;

EID: 33645106690     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-005-3299-y     Document Type: Article

References (25)

1. IEEE Std 1363-2000, IEEE Standard Specifications for Public-Key Cryptography, IEEE Computer Society, August 29, 2000.
2. M. Brown, D. Hankerson, J. López and A. Menezes, Software implementation of the NIST elliptic curves over prime fields, In (D. Naccache, ed.), Topics in Cryptology - CT-RSA 2001, vol. 2020 of Lecture Notes in Computer Science, Springer-Verlag, Berlin (2001), pp. 250-265.
3. I. F. Blake, G. Seroussi and N. P. Smart, Elliptic Curves in Cryptography, London Mathematical Society Lecture Note Series, 265, Cambridge University Press, Cambridge (2000).
4. H. Cohen, A. Miyaji and T. Ono, Efficient elliptic curve exponentiation using mixed coordinates, In (K. Ohta and D. Pei eds.), Advances in Cryptology - ASIACRYPT'98, Lecture Notes in Computer Science, 1514 Springer, Berlin (1998), pp. 51-65.
5. W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, Vol. 22, No. 6 (1976) pp. 644-654.
6. K. Eisenträger, K. Lauter and P. L. Montgomery, Fast elliptic curve arithmetic and improved Weil pairing evaluation. In (M. Joye ed.), Topics in Cryptology - CT-RSA 2003, Lecture Notes in Computer Science, 2612 Springer-Verlag, Berlin (2003) pp. 343-354.
7. R. P. Gallant, R. J. Lambert and S. A. Vanstone, Faster point multiplication on elliptic curves with efficient endomorphisms. In (J. Kilian ed.), Advances in Cryptology - CRYPTO 2001, Lecture Notes in Computer Science, 2139 Springer-Verlag, Berlin (2001) pp. 190-200.
8. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, Vol. 31 No. 4 (1985) pp. 469-472.
9. D. M. Gordon, A survey of fast exponentiation methods. Journal of Algorithms, Vol. 27 No. 1 (1998) pp. 129-146.
10. J. Guajardo and C. Paar, Efficient algorithms for elliptic curve cryptosystems. In (B.S. Kaliski Jr. ed.), Advances in Cryptology - CRYPTO '97, Lecture Notes in Computer Science, 1294 Springer-Verlag, Berlin (1997) pp. 342-356.
11. B. S. Kaliski Jr, The Montgomery inverse and its applications, IEEE Transactions on Computers, Vol. 44 No. 8 (1995) pp. 1064-1065.
12. N. Koblitz, Elliptic curve cryptosystems. Mathematics of Computation, Vol. 48 (1987) pp. 203-209.
13. Ç. K. Koç and E. Savaş., Architectures for unified field inversion with applications in elliptic curve cryptography. In 9th IEEE International Conference on Electronics, Circuits and Systems (ICECS2002), Dubrovnik, Croatia, 3 September 15-18 (2002) pp. 1155-1158.
14. C. H. Lim and P. J. Lee, More flexible exponentiation with precomputation. In (Y.G. Desmedt ed.), Advances in Cryptology - CRYPTO '94, Lecture Notes in Computer Science, 839 Springer-Verlag, Berlin (1994) pp. 95-107.
15. n), Selected Areas in Cryptography - SAC'98, Lecture Notes in Computer Science, 1556 Springer-Verlag, Berlin (1999) pp. 201-212.
16. R. Lórencz, New algorithm for classical modular inverse. In (B.S. Kaliski Jr., Ç.K. Koç and C. Paar, eds.), Cryptographic Hardware and Embedded Systems - CHES 2002, Lecture Notes in Computer Science, 2523 Springer-Verlag, Berlin (2003) pp. 57-70.
17. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton, FL (1997).
18. V. S. Miller, Use of elliptic curves in cryptography. In (H.C. Williams ed.), Advances in Cryptology - CRYPTO'85, Lecture Notes in Computer Science, 218 Springer-Verlag, Berlin (1986) pp. 417-426.
19. B. Möller, private communication.
20. P. L. Montgomery, Modular multiplication without trial division. Mathematics of Computation, Vol. 44, No. 170 (1985) pp. 519-521.
21. P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, Vol. 48, No. 177 (1987) pp. 243-264.
22. Y. Sakai and K. Sakurai, Efficient scalar multiplications on elliptic curves with direct computations of several doublings. IEICE Transactions Fundamentals, Vol. E84-A, No. 1 (2001) pp. 120-129.
23. E. Savaş. and Ç. K. Koç, The Montgomery modular inverse - revisited, IEEE Transactions on Computers, Vol. 49, No. 7 (2000) pp. 763-766.
24. J. A. Solinas, Low-weight binary representations for pairs of integers, Tech. Report CORR 2001/41, CACR, Waterloo (2001).
25. E. G. Straus, Addition chains of vectors (problem 5125). American Mathematical Monthly, Vol. 70, (1964) pp. 806-808.