1. Bach, E., Shallit, J.: Algorithmic Number Theory: Efficient Algorithms. MIT press, Cambridge (1996)
2. Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key $$d$$ d less than $$N^{0.292}$$ N 0.292 . In: Stern, J. (ed.) Advances in Cryptology, EUROCRYPT’99, pp. 1–11. Springer, Berlin (1999)
3. Boneh, D., Durfee, G.: Cryptanalysis of RSA with private key $$d$$ d less than $$N^{0.292}$$ N 0.292 . IEEE Trans. Inf. Theory 46(4), 1339–1349 (2000)
4. Boneh, D., Durfee, G., Frankel, Y.: Exposing an RSA private key given a small fraction of its bits. Available at Boneh’s web page at: http://crypto.stanford.edu/~dabo/abstracts/bits_of_d.html . Revised version of Asiacrypt’98 paper
5. Boneh, D., Durfee, G., Frankel, Y.: An attack on RSA given a small fraction of the private key bits. In: Ohta, K., Pei, D. (eds.) Advances in Cryptology, ASIACRYPT’98, pp. 25–34. Springer, Berlin (1998)