Skip to main content
Conference ProceedingsOPEN ACCESS

Low-exponent RSA with related messages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1070 1-9
DOI: 10.1007/3-540-68339-9_1
99Citations
Citations of this article
52Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we present a new class of attacks against RSA with low encrypting exponent. The attacks enable the recovery of plain- text 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.

Cite

CITATION STYLE

APA

Coppersmith, D., Franklin, M., Patarin, J., & Reiter, M. (1996). Low-exponent RSA with related messages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1070, pp. 1–9). Springer Verlag. https://doi.org/10.1007/3-540-68339-9_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free