Low-exponent RSA with related messages

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

Volumn 1070, Issue , 1996, Pages 1-9

  Coppersmith, Don ^a   Franklin, Matthew ^b   Patarin, Jacques ^c   Reiter, Michael ^b  

^a IBM RESEARCH   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c CP8 Transac ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CIPHERTEXTS; LOW EXPONENT RSA; PUBLIC KEYS;

CRYPTOGRAPHY;

EID: 84947902524     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68339-9_1     Document Type: Conference Paper

References (13)

1. M. Bellare and P. Rogaway. Optimal asymmetric encryption. InAdvances in Cryptology-EUROCRYPT'94 (Lecture Notes in Computer Science 950), A. De Santis, Ed. 1995, pp. 92-111, Springer-Verlag.
2. D. Coppersmith. Finding a small root of a univariate modular equation. InAdvances in Cryptology-EUROCRYPT'96, U. Maurer, Ed. 1996, Springer-Verlag.
3. M. K. Franklin and M. K. Reiter. Verifiable signature sharing. InAdvances in Cryptology-EUROCRYPT'95 (Lecture Notes in Computer Science 921), L. C. Guillou and J. Quisquater, Eds. 1995, pp. 50-63, Springer-Verlag.
4. M. K. Franklin and M. K. Reiter. A linear protocol failure for RSA with exponent three. Presented at the CRYPTO'95 Rump Session, Aug. 1995.
5. J. Hastad. Solving simultaneous modular equations of low degree.SIAM Journal of Computing 17:336-341, 1988.
6. J. H. Moore. Protocol failures in cryptosystems.Proceedings of the IEEE 76(5), May 1988.
7. C. Park, K. Kurosawa, T. Okamoto, and S. Tsujii. On key distribution and authentication in mobile radio networks. InAdvances in Cryptology-EUROCRYPT'9S(Lecture Notes in Computer Science 765), T. Helleseth, Ed. 1994, pp. 461-465, Springer-Verlag.
8. R. L. Rivest, A. Shamir and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems.Communications of the ACM 21(2): 120-126, Feb. 1978.
9. A. Shamir. How to share a secret.Communications of the ACM 22(11):612-613, Nov. 1979.
10. G. Simmons. A "weak" privacy protocol using the RSA cryptoalgorithm. CYyp-tologia 7:180-182, 1983.
11. G. Simmons. Proof of soundness (integrity) of cryptographic protocols.Journal of Cryptology 7:69-77, 1994.
12. V. Strassen. The computational complexity of continued fractions.SIAM Journal of Computing 12(1): 1-27, 1983.
13. M. Tatebayashi and N. Matsuzakai and D. B. Newman. Key distribution protocol for digital mobile communication systems. InAdvances in Cryptology-CRYPTO'89(Lecture Notes in Computer Science 435), G. Brassard, Ed. 1990, pp. 324-333, Springer-Verlag.