Elliptic curve cryptosystems in the presence of permanent and transient faults

Designs, Codes, and Cryptography

Volumn 36, Issue 1, 2005, Pages 33-43

  Ciet, Mathieu ^a   Joye, Marc ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b GEMPLUS   (France)

Author keywords

Elliptic curve cryptography; Fault analysis; Fault attacks; Information leakage

Indexed keywords

COMPUTATIONAL METHODS; ERROR ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

ELLIPTIC CURVE CRYPTOGRAPHY; FAULT ANALYSIS; FAULT ATTACKS; INFORMATION LEAKAGE;

CRYPTOGRAPHY;

EID: 18744405402     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-003-1160-8     Document Type: Article

References (25)

1. IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society, August 29, 2000.
2. Federal Information Processing Standards Publication FIPS 186-2. Digital Signature Standard (DSS), appendix 6: "Recommended elliptic curves for federal government use". National Institute of Standards and Technology, January 27, 2000. Available at URL http://csrc.nist.gov/publications/fips/fips186-2/fips186-2.pdf.
3. F. Bao, R. H. Deng, Y. Han, A. B. Jeng, A. D. Narasimbalu and T.-H. Ngair. Breaking public key cryptosystems on tamper resistant devices in the presence of transient faults. In B. Christianson, B. Crispo, M. Lomas and M. Roe (eds), Security Protocols, Volume 1361 of Lecture Notes in Computer Science, Springer-Verlag (1997) pp. 115-124.
4. I. Biehl, B. Meyer and V. Müller. Differential fault attacks on elliptic curve cryptosystems. In M. Bellare (ed.), Advances in Cryptology - CRYPTO 2000, Volume 1880 of Lecture Notes in Computer Science, Springer-Verlag (2000) pp. 131-146.
5. E. Biham and A. Shamir, Differential fault analysis of secret key cryptosystems. In B. S. Kaliski Jr. (ed.), Advances in Cryptology - CRYPTO'97. Volume 1294 of Lecture Notes in Computer Science, Springer-Verlag (1997) pp. 513-525.
6. D. Boneh, R. A. DeMillo and R. J. Lipton, On the importance of checking cryptographic protocols for faults. In W. Fumy (ed.), Advances in Cryptology - EUROCRYPT'97, Volume 1233 of Lecture Notes in Computer Science, Springer-Verlag (1997) pp. 37-51.
7. D. Boneh, R. A. DeMillo and R. J. Lipton, On the importance of eliminating errors in cryptographic computations. Journal of Cryptology, Vol. 14, No. 2 (2001) pp. 101-119. An earlier version appears in [6].
8. E. De Win, S. Mister, B. Preneel and M. Wiener, On the performance of signature schemes based on elliptic curves. In J.-P. Buhler (ed.), Algorithmic Number Theory Symposium, Volume 1423 of Lecture Notes in Computer Science, Springer-Verlag (1998) pp. 252-266.
9. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, Vol. IT-31, No. (4) (1985) pp. 469-472.
10. S. D. Galbraith, F. Hess and N. P. Smart, Extending the GHS Weil descent attack. In L. Knudsen (ed.), Advances in Cryptology - EUROCRYPT 2002, Volume 2332 of Lecture Notes in Computer Science, Springer-Verlag (2002) pp. 29-44.
11. P. Gaudry, F. Hess and N. P. Smart, Constructive and destructive facets of Weil descent on elliptic curves. Journal of Cryptology, Vol. 15, No. 1 (2002) pp. 19-46.
12. F. Hess, The GHS attack revisited. In E. Biham (ed.), Advances in Cryptology - EUROCRYPT 2003, Volume 2656 of Lecture Notes in Computer Science, Springer-Verlag (2003) 374-387.
13. M. Joye, J.-J. Quisquater, F. Bao and R. H. Deng, RSA-type signatures in the presence of transient faults. In M. Darnell, (ed.), Cryptography and Coding, Volume 1355 of Lecture Notes in Computer Science, Springer-Verlag (1997) pp. 155-160.
14. N. Koblitz, Elliptic curve cryptosystems. Mathematics of Computation, Vol. 48, No. 177 (1987) pp. 203-209.
15. P. Kocher, Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In N. Koblitz (ed.), Advances in Cryptology - CRYPTO '96, Volume 1109 of Lecture Notes in Computer Science, Springer-Verlag (1996) pp. 104-113.
16. P. Kocher, J. Jaffe and B. Jun, Differential power analysis. In M. Wiener (ed.), Advances in Cryptology - CRYPTO '99, Volume 1666 of Lecture Notes in Computer Science, Springer-Verlag (1999) pp. 388-397.
17. M. Maurer, A. J. Menezes and E. Teske, Analysis of the GHS Weil descent attack on the ECDLP over characteristic two finite fields of composite degree. In C. Pandu Rangan and C. Ding (ed.), Progress in Cryptology - INDOCRYPT 2001, Volume 2247 of Lecture Notes in Computer Science, Springer-Verlag (2001) pp. 195-213.
18. A. J. Menezes, Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers (1993).
19. A. Menezes, T. Okamoto and S. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory, Vol. 39 (1993) pp. 1639-1646.
20. A. J. Menezes and M. Qu, Analysis of the Weil descent attack of Gaudry, Hess and Smart. In D. Naccache (ed.), Topics in Cryptology - CT-RSA 2001, Volume 2020 of Lecture Notes in Com-puter Science, Springer (2001) pp. 308-318.
21. V. S. Miller, Use of elliptic curves in cryptography. In H. C. Williams (ed.), Advances in Cryptology - CRYPTO '85, Volume 218 of Lecture Notes in Computer Science. Springer (1986) pp. 417-426.
22. J. M. Pollard, Monte Carlo methods for index computation (mod p). Mathematics of Computation, Vol. 32 (1978) pp. 918-924.
23. J. M. Pollard, Kangaroos, monopoly and discrete logarithms. Journal of Cryptology, Vol. 13, No. 4 (2000) pp. 437-447.
24. N. P. Smart, How secure are elliptic curves over composite extension fields? In B. Pfitzmann (ed.), Advances in Cryptology - EUROCRYPT 2001, Volume 2045 of Lecture Notes in Computer Science, Springer-Verlag (2001) pp. 30-39.
25. J. A. Solinas, Generalized Mersenne numbers. Technical Report CORR-99-39, Dept of C&O, University of Waterloo, Canada (1999).