Attacks on Shamir's 'RSA for paranoids'

Information Processing Letters

Volumn 68, Issue 4, 1998, Pages 197-199

  Gilbert, Henri ^a   Gupta, Dipankar ^b   Odlyzko, Andrew ^c   Quisquater, Jean Jacques ^d  

^a ORANGE LABS   (France)

^b HEWLETT PACKARD LABORATORIES   (United Kingdom)

^c AT AND T LABS RESEARCH   (United States)

^d UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Cryptography; Safety security in digital systems

Indexed keywords

DIGITAL STORAGE; SECURITY OF DATA;

SECRET KEYS;

CRYPTOGRAPHY;

EID: 0032206093     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00160-4     Document Type: Article

References (6)

1. J. Hastad, On using RSA with low exponent in a public key network, in: H.C. Williams (Ed.), Advances in Cryptology -CRYPTO '85, Lecture Notes in Computer Sci., Vol. 218, Springer, Berlin, 1986, pp. 403-408.
2. M. Joye, J.-J. Quisquater, On the importance of securing your bins: The garbage-man-in-the-middle attack, in: T. Matsumoto (Ed.), 4th ACM Conf. Computer Comm. Security, ACM Press, 1997, pp. 135-141.
3. A.M. Odlyzko, The future of integer factorization, CryptoBytes (The Technical Newsletter of RSA Laboratories) 1 (2) (1995) 5-12. Available at (http://www.rsa.com/rsalabs/cryptobytes/) and at (http://www.research.att.com/~amo).
4. A. Shamir, RSA for paranoids, CryptoBytes (The Technical Newsletter of RSA Laboratories) 1 (3) (1995) 1, 3, and 4. Available at (http://www.rsa.com/rsalabs/cryptobytes/).
5. D.R. Stinson, Cryptography: Theory and Practice, CRC Press, 1995.
6. M.J. Wiener, Cryptanalysis of short RSA secret exponents, IEEE Trans. Inform. Theory 36 (1990) 553-558.