Abstract
At the Eurocrypt meeting, a public-key cryptosystem based on rational numbers has been proposed [2]. We show that this system is not secure. Our attack uses the LLL algorithm. Numerical computations confirm that it is successful.
Research supported by the PRC mathématiques et informatique
Chapter PDF
Similar content being viewed by others
References
E.F. Brickell, The cryptanalysis of knapsack cryptosystems. Proceedings of the third SIAM discrete mathematics conference.
H. Isselhorst, The use of fractions in public-key cryptosystems. Proceedings Eurocrypt’89.
A.K. Lenstra, H.W. Lenstra, L. Lovász, Factoring polynomials with rational coefficients. Math. Annalen 261 (1982) 515–534.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stern, J., Toffin, P. (1991). Cryptanalysis of a public-key cryptosystem based on approximations by rational numbers. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_28
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive