Resistance against differential power analysis for elliptic curve cryptosystems

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

Volumn 1717, Issue , 1999, Pages 292-302

  Coron, Jean Sébastien ^a,b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b GEMPLUS   (France)

Author keywords

Differential power analysis; Elliptic curve; Power consumption

Indexed keywords

ELECTRIC POWER UTILIZATION; EMBEDDED SYSTEMS; GEOMETRY; RECOVERY; SMART CARDS;

DES ALGORITHMS; DIFFERENTIAL POWER ANALYSIS; DIFFIE-HELLMAN KEY EXCHANGE; DPA ATTACKS; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEMS; POWER SIGNALS; PRIVATE KEY;

SIDE CHANNEL ATTACK;

EID: 84880293917     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48059-5_25     Document Type: Conference Paper

References (18)

1. E. Biham, A. Shamir. Power analysis of the key scheduling of the AES candidates, Proceedings of the second AES Candidate Conference, March 1999, pp. 115-121.
2. E. Brickell, D. Gordon, K. McCurley, D. Wilson. Fast Exponentiation with Pre-computation (Extended Abstract), Advances in Cryptology - Eurocrypt '92, LNCS 658 (1993), Springer-Verlag, pp. 200-207.
3. S. Chari, C. Jutla, J.R. Rao, P. Rohatgi. A cautionary note regarding evaluation of AES candidates on smart-cards, Proceedings ofthe second AES Candidate Conference, March 1999, pp. 133-147.
4. D. Chaum. Security without identification: transaction systems to make Big Brother obsolete, Communications ofthe ACM, vol. 28, n. 10, Oct 1985, pp. 1030-1044.
5. J. Daemen, V. Rijmen. Resistance against implementation attacks A comparative study of the AES proposals, Proceedings ofthe second AES Candidate Conference, March 1999, pp. 122-132.
6. FIPS 46, Data encryption standard, Federal Information Processing Standards Publication 46, U.S. Department of Commerce/National Bureau of Standards, National Technical Information Service, Springfield, Virginia, 1977.
7. W. Diffie and M. Hellman. New directions in cryptography, IEEE Trans. Info. Theory, IT-22, 1976, pp 644-654.
8. T. El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Info. Theory, IT-31, 1985, pp 469-472.
9. D.M. Gordon. A Survey of Fast Exponentiation Methods, Journal of Algorithms 27, 129-146 (1998).
10. IEEE P1363/D7. Standard Specifications for Public Key Cryptography. September 11, 1998.
11. D.E. Knuth, Seminumerical Algorithms, The Art of Computer Programming, 2 Addison Wesley, 1969.
12. N. Koblitz. Elliptic Curve Cryptosystems, Mathematics of Computation, vol. 48, 1987, pp. 203-209.
13. Paul Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS and other systems, Advances in Cryptology, Proceedings of Crypto' 96, LNCS 1109,N. Koblitz, Ed., Springer-Verlag, 1996, pp. 104-113.
14. Paul Kocher, Joshua Jaffe, and Benjamin Jun, Introduction to Differential Power Analysis and Related Attacks, http://www.cryptography.com/dpa/technical, 1998.
15. K. Koyama, Y. Tsuruoka, Speeding up elliptic cryptosystems by using a signed binary window method, Advances in Cryptology- Proceedings of Crypto '92, LNCS 740, pp. 345-357, Springer-Verlag, Berlin/New-York, 1993.
16. A. J. Menezes, "Elliptic Curve Public Key Cryptosystems", Kluwer Academic Publishers, 1993.
17. V.S. Miller. Use of Elliptic Curves in Cryptography, Proceedings of Crypto 85, LNCS 218, Springer, 1986, pp. 417-426.
18. F. Morain, J. Olivos. Speeding up the computation of an elliptic curve using addition-subtraction chains, Inform. Theory Appl. 24 (1990), 531-543.