Differential fault attacks on elliptic curve cryptosystems

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

Volumn 1880, Issue , 2000, Pages 131-146

  Biehl, Ingrid ^a   Meyer, Bernd ^b   Müller, Volker ^c  

^a Department for Industrial Engineering and Technology Management   (Germany)

^b SIEMENS AG   (Germany)

^c Universitas Kristen Duta Wacana   (Indonesia)

Author keywords

Differential fault attack; Elliptic curve cryptosystem

Indexed keywords

COMPUTER SOFTWARE; CURVE FITTING; GEOMETRY;

DIFFERENTIAL FAULT ATTACK; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEM; ELLIPTIC CURVE CRYPTOSYSTEMS; RSA CRYPTOSYSTEMS; SECRET KEY; SOFTWARE SIMULATION; TAMPER-PROOF DEVICES;

CRYPTOGRAPHY;

EID: 84983134283     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44598-6_8     Document Type: Conference Paper

References (13)

1. R. J. Anderson and M. G. Kuhn: Tamper Resistance-a Cautionary Note, Proceedings of Second USENIX Workshop on Electronic Commerce 1996, pp. 1-11.
2. R. J. Anderson and M. G. Kuhn: Low Cost Attacks on Tamper Resistant Devices, Lecture Notes in Computer Science 1361, Proceedings of International Workshop on Security Protocols 1997, Springer, pp. 125-136.
3. E. Biham and A. Shamir: Differential Fault Analysis of Secret Key Cryptosystems, Lecture Notes of Computer Science 1294, Proceedings of CRYPTO’97, Springer, pp. 513-525.
4. D. Boneh, R. A. DeMillo, and R. J. Lipton: On the Importance of Checking Cryptographic Protocols for Faults, Lecture Notes of Computer Science 1233, Proceedings of EUROCRYPT’97, Springer, pp. 37-51.
5. M. Burmester: A Remark on the Efficiency of Identification Schemes, Lecture Notes of Computer Science 473, Proceedings of EUROCRYPT’90, Springer, pp. 493-495.
6. I. Connell: Elliptic Curve Handbook, Preprint, 1996.
7. IEEE P1363 Draft Version 12: Standard Specifications for Public Key Cryptography, available on the Homepage of the IEEE.
8. O. Kömmerling and M. G. Kuhn: Design Principles for Tamper-Resistant Smartcard Processors, Proceedings of USENIXWorkshop on Smartcard Technology 1999, pp. 9-20.
9. H. W. Lenstra: Factoring Integers with Elliptic Curves, Annals of Mathematics, 126 (1987), pp. 649-673.
10. C. H. Lim and P. J. Lee: A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroup, Lecture Notes of Computer Science 1294, Proceedings of CRYPTO’97, Springer, pp. 249-263.
11. A. Menezes: Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, 1993.
12. S. Pohlig and M. Hellman: An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance, IEEE Transactions on Information Theory, vol. 24(1978), pp. 106-110.
13. J. H. Silverman: The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics 106, Springer 1986.