Weierstraß elliptic curves and side-channel attacks

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

Volumn 2274, Issue , 2002, Pages 335-345

  Brier, Éric ^a   Joye, Marc ^a  

^a GEMPLUS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GEOMETRY; PUBLIC KEY CRYPTOGRAPHY;

ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEMS; GENERIC SOLUTIONS; MONTGOMERY; PROTECTION METHODS; RUNNING TIME; SIDE-CHANNEL ANALYSIS;

SIDE CHANNEL ATTACK;

EID: 84958979095     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45664-3_24     Document Type: Conference Paper

References (17)

1. Christophe Clavier and Marc Joye. Universal exponentiation algorithm: A first step towards provable SPA-resistance. InÇ.K. Koç, D. Naccache, and C. Paar, editors, Cryptographic Hardware and Embedded Systems -CHES 2001, volume 2162 of Lecture Notes in Computer Science, pages 305–314. Springer-Verlag, 2001.
2. Jean-Sébastien Coron. Resistance against differential power analysis for elliptic curve cryptosystems. In Ç.K. Koç and C. Paar, editors, Cryptographic Hardware and Embedded Systems (CHES’99), volume 1717 of Lecture Notes in Computer Science, pages 292–302. Springer-Verlag, 1999.
3. Erik De Win, Serge Mister, Bart Preneel, and Michael Wiener. On the performance of signature schemes based on elliptic curves. In J.-P. Buhler, editor, Algorithmic Number Theory Symposium, volume 1423 of Lecture Notes in Computer Science, pages 252–266. Springer-Verlag, 1998.
4. Marc Joye and Jean-Jacques Quisquater. Hessian elliptic curves and sidechannel attacks. In Ç.K. Ko ç, D. Naccache, and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2001, volume 2162 of Lecture Notes in Computer Science, pages 412–420. Springer-Verlag, 2001.
5. Marc Joye and Christophe Tymen. Protections against differential analysis for elliptic curve cryptography: an algebraic approach. In Ç.K. Ko ç, D. Naccache, and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2001, volume 2162 of Lecture Notes in Computer Science, pages 386–400. Springer-Verlag, 2001.
6. Paul Kocher, Joshua Jaffe, and Benjamin Jun. Differential power analysis. In M. Wiener, editor, Advances in Cryptology – CRYPTO’99, volume 1666 of Lecture Notes in Computer Science, pages 388–397. Springer-Verlag, 1999.
7. Donald E. Knuth. The art of computer programming, v. 2. Seminumerical algorithms. Addison-Welsley, 2nd edition, 1981.
8. Paul Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In N. Koblitz, editor, Advances in Cryptology –CRYPTO’96, volume 1109 of Lecture Notes in Computer Science, pages 104–113. Springer-Verlag, 1996.
9. Julio Lopez and Ricardo Dahab. Fast multiplication on elliptic curves over GF(2m) without precomputation. In Ç.K. Ko ç and C. Paar, editors, Cryptographic Hardware and Embedded Systems, volume 1717 of Lecture Notes in Computer Science, pages 316–327. Springer-Verlag, 1999.
10. Pierre-Yvan Liardet and Nigel P. Smart. Preventing SPA/DPA in ECC systems using the Jacobi form. In Ç.K. Koç, D. Naccache, and C. Paar, editors, Cryptographic Hardware and Embedded Systems - CHES 2001, volume 2162 of Lecture Notes in Computer Science, pages 401–411. Springer-Verlag, 2001.
11. Fran¸cois Morain and Jorge Olivos. Speeding up the computations on an elliptic curve using addition-subtraction chains. Theoretical Informatics and Applications, 24:531–543, 1990.
12. Bodo M¨oller. Securing elliptic curve point multiplication against sidechannel attacks. In G.I. Davida and Y. Frankel, editors, Information Security, volume 2200 of Lecture Notes in Computer Science, pages 324–334. Springer-Verlag, 2001.
13. Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243–264, January 1987.
14. National Institute of Standards and Technology (NIST). Digital signature standard (DSS). FIPS PUB 186-2, 2000.
15. Katsuyuki Okeya and Kouichi Sakurai. Power analysis breaks elliptic curve cryptosystems even secure against the timing attack. In B. Roy and E. Okamoto, editors, Progress in Cryptology – INDOCRYPT2000, volume 1977 of Lecture Notes in Computer Science, pages 178–190. Springer-Verlag, 2000.
16. Certicom Research. Standards for efficient cryptography. Version 1.0, 2000. Available at url http://www.secg.org/.
17. Joseph H. Silverman. The arithmetic of elliptic curves, volume 106 of Graduate Texts in Mathematics. Springer-Verlag, 1986.