Chinese remaindering based cryptosystems in the presence of faults

Journal of Cryptology

Volumn 12, Issue 4, 1999, Pages 241-245

  Joye, Marc ^a   Lenstra, Arjen K ^b   Quisquater, Jean Jacques ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b Citibank NA   (United States)

Author keywords

Chinese remaindering; Faulty computations; Public key cryptosystems

Indexed keywords

EID: 0004794569     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900055     Document Type: Article

References (20)

1. R. Anderson and M. Kühn. Tamper resistance-a cautionary note. In Proceedings of the Second USEN1X Workshop on Electronic Commerce, pp. 1-11. USENIX Association, Berkeley, 1996.
2. R. Anderson and M. Kühn. Low cost attacks on tamper resistant devices. In B. Christianson, B. Crispo, M. Lomas, and M. Roe, editors, Security Protocols, pp. 125-136. Lecture Notes in Computer Science, 1361. Springer-Verlag, Berlin, 1998.
3. F. Bao, R. H. Deng, Y. Han, A. Jeng, A. D. Narasimhalu, and T. 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, editors, Security Protocols, pp. 115-124. Lecture Notes in Computer Science, 1361. Springer-Verlag, Berlin, 1998.
4. E. Biham and A. Shamir. Differential fault analysis of secret key cryptosystems. In B. S. Kaliski Jr., editor, Advances in Cryptology - CRYPTO '97, pp. 513-525. Lecture Notes in Computer Science, 1294. Springer-Verlag, Berlin, 1997.
5. D. Boneh, R. A. DeMillo, and R. J. Lipton. On the importance of checking cryptographic protocols for faults. In W. Fumy, editor. Advances in Cryptology - EUROCRYPT '97', pp. 37-51. Lecture Notes in Computer Science, 1233. Springer-Verlag, Berlin, 1997.
6. N. Demytko. A new elliptic curve based analogue of RSA. In T. Helleseth, editor, Advances in Cryptology - EUROCRYPT'93, pp. 40-49. Lecture Notes in Computer Science, 765. Springer-Verlag, Berlin, 1993.
7. P. Gutmann. Secure deletion of data from magnetic and solid-state memory. In Proceedings of Sixth USENIX Security Symposium, pp. 77-89. USENIX Association, Berkeley, 1996.
8. M. Joye and J.-J. Quisquater. Attacks on systems using Chinese remaindering. Technical Report CG-1996/9, UCL Crypto Group, Louvain-la-Neuve, November 1996.
9. B. S. Kaliski Jr. and M. J. B. Robshaw. Comments on some attacks on cryptographic devices. RSA Laboratories' Bulletin, no. 5, RSA Laboratories, Redwood City, July 1997.
10. O. Kocar. Hardwaresicherheit von Mikrochips in Chipkarten. Datenschutz und Datensicherheit, 20, no. 7, pp. 421-424, July 1996
11. K. Koyama, U. M. Maurer, T. Okamoto, and S. A. Vanstone. New public-key schemes based on elliptic curves over the ring Z. In J. Feigenbaum, editor, Advances in Cryptology - CRYPTO '91, pp. 252-266. Lecture Notes in Computer Science, 576. Springer-Verlag, Berlin, 1991.
12. A. K. Lenstra. RSA signature generation in the presence of faults, Memo, Parsippany, September 1996.
13. P. Paillier. Real life DFA is inherently limited. Presented at the rump session of EUROCRYPT'97, 11-15th May 1997, Konstanz.
14. I. Peterson. Chinks in digital armor-Exploiting faults to break smart-card cryptosystems. Science Nen-s, 151, no. 5, pp. 78-79, February 1997.
15. J.-J. Quisquater. The adolescence of smart cards. Future Generation Computer Systems, 13, no. 1, pp. 3-7, June 1997.
16. R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21, no. 2, pp. 120-126, February 1978.
17. A. Shamir. How to check modular exponentiation. Presented at the rump session of EUROCRYPT '97, ll-15th May 1997, Konstanz.
18. J. H. Silverman. The Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, 106. Springer-Verlag, New York, 1986.
19. P. J. Smith and M. J. J. Lennon. LUC: a new public key system. In E. G. Douglas, editor, Proceedings of the Ninth IF1P Symposium on Computer Security, pp. 103-117. Elsevier, Amsterdam, 1993.
20. Y. Zheng and T. Matsumoto. Breaking real-world implementations of cryptosystems by manipulating their random number generation. In Pre-proceedings of the 1997 Symposium on Cryptography and Information Security, 29lh January-lst February 1997, Fukuoka.