论文信息 - Low-Exponent RSA with Related Messages

Low-Exponent RSA with Related Messages

In this paper we present a new class of attacks against RSA with low encrypting exponent. The attacks enable the recovery of plaintext messages from their ciphertexts and a known polynomial relationship among the messages, provided that the ciphertexts were created using the same RSA public key with low encrypting exponent.

[1] Volker Strassen,et al. The computational complexity of continued fractions , 1981, SYMSAC '81.

[2] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[3] Adi Shamir,et al. How to share a secret , 1979, CACM.

[4] Natsume Matsuzaki,et al. Key Distribution Protocol for Digital Mobile Communication Systems , 1989, CRYPTO.

[5] Matthew K. Franklin,et al. Verifiable Signature Sharing , 1995, EUROCRYPT.

[6] J. H. Moore. Protocol failures in cryptosystems , 1988, Proc. IEEE.

[7] Gustavus J. Simmons,et al. A "Weak" Privacy Protocol using the RSA Crypto Algorithm , 1983, Cryptologia.

[8] Kaoru Kurosawa,et al. On Key Distribution and Authentication in Mobile Radio Networks , 1994, EUROCRYPT.

[9] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[10] Don Coppersmith,et al. Finding a Small Root of a Univariate Modular Equation , 1996, EUROCRYPT.

[11] Johan Håstad,et al. Solving Simultaneous Modular Equations of Low Degree , 1988, SIAM J. Comput..

[12] Mihir Bellare,et al. Optimal Asymmetric Encryption , 1994, EUROCRYPT.

[13] Alfredo De Santis,et al. Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.