[4] D. Boneh, G. Durfee, and Y. Frankel, “An attack on RSA given a small fraction of the private key bits,” Advances in Cryptology–ASIACRYPT ’98 (Lecture Notes in Computer Science). Berlin Germany: Springer-Verlag, vol. 1514, pp. 25-34, 1998.
[5] D. Boneh and R. Venkatesan, “Breaking RSA may not be equivalent to factoring,” Advances in Cryptology–EUROCRYPT '98 (Lecture Notes in Computer Science). Berlin Germany: Springer-Verlag, vol. 1233, pp. 59-71, 1998.
[6] D. Coppersmith, “Finding a small root of a bivariate integer equation: factoring with high bits known,” Advances in Cryptology–EUROCRYPT ’96 (Lecture Notes in Computer Science). Berlin Germany: Springer-Verlag, vol. 1070, pp. 178-189, 1996.