Fast Elliptic Curve Multiplications with SIMD Operations

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E87-A, Issue 1, 2004, Pages 85-93

  Izu, Tetsuya ^a   Takagi, Tsuyoshi ^b  

^a FUJITSU LABORATORIES LTD   (Japan)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Elliptic Curve Cryptosystems (ECC); Scalar multiplication; Side channel attacks; SIMD operations; Window method

Indexed keywords

ALGORITHMS; BINARY CODES; COMPUTATIONAL METHODS; CRYPTOGRAPHY; CURVE FITTING; DATA REDUCTION; ITERATIVE METHODS; MICROPROCESSOR CHIPS; SMART CARDS;

ELLIPTIC CURVE CRYPTOSYSTEMS (ECC); SCALAR MULTIPLICATION; SIDE CHANNEL ATTACKS; SINGLE INSTRUCTION MULTIPLE DATA (SIMD); WINDOW METHOD;

COMPUTER ARCHITECTURE;

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

References (23)

1. K. Aoki, F. Hoshino, T. Kobayashi, and H. Oguro, "Elliptic curve arithmetic using SIMD," ISC2001, LNCS 2200, pp.235-247, Springer-Verlag, 2001.
2. E. Brier and M. Joye, "Weierstraß elliptic curves and side-channel attacks," PKC2002, LNCS 2274, pp.335-345, Springer-Verlag, 2002.
3. M. Brown, D. Hankerson, J. Lopez, and A. Menezes, "Software implementation of the NIST elliptic curves over prime fields," CT-RSA 2001, LNCS 2020, pp.250-265, 2001.
4. J. Coron, "Resistance against differential power analysis for elliptic curve cryptosystems," CHES'99, LNCS 1717, pp.292-302, Springer-Verlag, 1999.
5. H. Cohen, A. Miyaji, and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates," Asiacrypt'98, LNCS 1514, pp.51-65, Springer-Verlag, 1998.
6. E. de Win, S. Mister, B. Preneel, and M. Wiener, "On the performance of signature schemes based on elliptic curves," ANTS-III, LNCS 1423, pp.252-266, 1998.
7. p hedged against non-differential side-channel attacks," Cryptology ePrint Archive, 2002/007, IACR, 2002. Available at http://eprint.iacr.org/2002/007
8. IEEE P1363, Standard Specifications for Public-Key Cryptography, 2000. Available at http://groupe.ieee.org/groups/1363/
9. K. Itoh, M. Takenaka, N. Torii, S. Temma, and Y. Kurihara, "Fast implementation of public-key cryptography on DSP TMS320C6201," CHES'99, LNCS 1717, pp.61-72, 1999.
10. T. Izu and T. Takagi, "A fast parallel elliptic curve multiplication resistant against side channel attacks," PKC2002, LNCS 2274, pp.280-296, 2002.
11. T. Izu and T. Takagi, "A fast parallel elliptic curve multiplication resistant against side channel attacks," Technical Report of CACR, CORR 2002-03, University of Waterloo, 2002. Available at http://www.cacr.math.uwaterloo.ca
12. M. Joye and C. Tymen, "Protections against differential analysis for elliptic curve cryptography," CHES2001, LNCS 2162, pp.377-390, Springer-Verlag, 2001.
13. C. Kocher, "Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems," Crypto'96, LNCS 1109, pp.104-113, Springer-Verlag, 1996.
14. C. Kocher, J. Jaffe, and B. Jun, "Differential power analysis, " Crypto'99, LNCS 1666, pp.388-397, Springer-Verlag, 1999.
15. K. Koyama and Y. Tsuruoka, "Speeding up elliptic curve cryptosystems using a signed binary windows method," Crypto'92, LNCS 740, pp.345-357, Springer-Verlag, 1992.
16. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of applied cryptography, CRC Press, 1997.
17. B. Möller, "Securing elliptic curve point multiplication against side-channel attacks," ISC 2001, LNCS 2200, pp.324-334, Springer-Verlag, 2001.
18. P. Montgomery, "Speeding the Pollard and elliptic curve methods for factorizations," Math. Comput., vol.48, pp.243-264, 1987.
19. National Institute of Standards and Technology, "Recommended elliptic curves for federal government use," in the appendix of FIPS 186-2, Available at http://csrc.nist.gov/publication/fips/fips186-2/fips186-2.pdf
20. K. Okeya, H. Kurumatani, and K. Sakurai, "Elliptic curves with the Montgomery form and their cryptographic applications," PKC2000, LNCS 1751, pp.446-465, Springer-Verlag, 2000.
21. K. Okeya and K. Sakurai, "Power analysis breaks elliptic curve cryptosystems even secure against the timing attack," Indocrypt 2000, LNCS 1977, pp.178-190, Springer-Verlag, 2000.
22. N. Smart, "The Hessian form of an elliptic curve," CHES2001, LNCS 2162, pp.118-125, Springer-Verlag, 2001.
23. Standards for Efficient Cryptography Group (SECG), Specification of Standards for Efficient Cryptography. Available at http://www.secg.org