Abstract
Chosen-message attack on RSA is usually considered as an inherent property of its homomorphic structure. In this paper, we show that non-homomorphic RSA-type cryptosystems are also susceptible to a chosen-message attack. In particular, we prove that only one message is needed to mount a successful chosen-message attack against the Lucasbased systems and Demytko's elliptic curve system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Bleichenbacher, W. Bosma, and A. K. Lenstra. Some remarks on Lucas-based cryptosystems. In D. Coppersmith, editor, Advance in Cryptology — Crypto '95, volume 963 of Lectures Notes in Computer Science, pages 386–396. Springer-Verlag, 1995.
D. M. Bressoud. Factorization and primality testing. Undergraduate Texts in Mathematics. Springer-Verlag, 1989.
G. Davida. Chosen signature cryptanalysis of the RSA (MIT) public key cryptosystem. Technical Report TR-CS-82-2, Dept. of Electrical Engineering and Computer Science, University of Wisconsin, Milwaukee, USA, October 1982.
N. Demytko. A new elliptic curve based analogue of RSA. In T. Helleseth, editor, Advance in Cryptology — Eurocrypt '93, volume 765 of Lectures Notes in Computer Science, pages 40–49. Springer-Verlag, 1994.
D. E. Denning. Digital signatures with RSA and other public-key cryptosystems. Communications of the ACM, 27(4):388–392, April 1984.
B. S. Kaliski Jr. A chosen message attack on Demytko's elliptic curve cryptosystem. Journal of Cryptology, 10(1):71–72, 1997.
N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203–209, 1987.
K. Koyama, U. M. Maurer, T. Okamoto, and S. A. Vanstone. New public-key schemes based on elliptic curves over the ring Zn. In J. Feigenbaum, editor, Advance in Cryptology — Crypto '91, volume 576 of Lectures Notes in Computer Science, pages 252–266. Springer-Verlag, 1991.
V. S. Miller. Use of elliptic curves in cryptography. In H. C. Williams, editor, Advance in Cryptology — Crypto '85, volume 218 of Lectures Notes in Computer Science, pages 417–426. Springer-Verlag, 1986.
W. B. Müller and R. Nöbauer. Some remarks on public-key cryptosystems. Sci. Math. Hungar, 16:71–76, 1981.
W. B. Müller and R. Nöbauer. Cryptanalysis of the Dickson scheme. In J. Pichler, editor, Advance in Cryptology — Eurocrypt '85, volume 219 of Lectures Notes in Computer Science, pages 50–61. Springer-Verlag, 1986.
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, February 1978.
G. J. Simmons. A weak privacy protocol using the RSA cryptoalgorithm. Cryptologia, 7:180–182, 1983.
P. J. Smith and M. J. J. Lennon. LUC: A new public key system. In E. G. Douglas, editor, Ninth IFIP Symposium on Computer Security, pages 103–117. Elsevier Science Publishers, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Bleichenbacher, D., Joye, M., Quisquater, JJ. (1997). A new and optimal chosen-message attack on RSA-type cryptosystems. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028486
Download citation
DOI: https://doi.org/10.1007/BFb0028486
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63696-0
Online ISBN: 978-3-540-69628-5
eBook Packages: Springer Book Archive