Abstract
Many recently proposed cryptosystems are based on the assumption that factoring large composite integers is computationally difficult. In this paper we examine this assumption when the cryptanalyst has “side information” available.
Chapter PDF
References
Blum, Manuel. “How to exchange secrets,” Proc. 15th Annual ACM STOC Conference (1983), 440–447.
Lenstra, H. W., Jr. “Integer programming in a fixed number of variables,” Report 81-03, Mathematisch Institut, Universitat ban Amsterdam (1981).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rivest, R.L., Shamir, A. (1986). Efficient Factoring Based on Partial Information. In: Pichler, F. (eds) Advances in Cryptology — EUROCRYPT’ 85. EUROCRYPT 1985. Lecture Notes in Computer Science, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39805-8_3
Download citation
DOI: https://doi.org/10.1007/3-540-39805-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16468-5
Online ISBN: 978-3-540-39805-9
eBook Packages: Springer Book Archive