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.
CITATION STYLE
Rivest, R. L., & Shamir, A. (1986). Efficient Factoring Based on Partial Information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 219 LNCS, pp. 31–34). Springer Verlag. https://doi.org/10.1007/3-540-39805-8_3
Mendeley helps you to discover research relevant for your work.