Part of the Lecture Notes in Computer Science book series (LNCS, volume 219)
Efficient Factoring Based on Partial Information
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.
© Springer-Verlag Berlin Heidelberg 1986