Cryptanalysis of RSA Factorization - Library(ISI Kolkata) - Indian ...

BIBLIOGRAPHY 158
[9] J. Blömer and A. May. A generalized Wiener attack on RSA. In Proceedings
of PKC’04, volume 2947 of Lecture Notes in Computer Science, pages 1–13,
2004.
[10] J. Blömer and A. May. A tool kit for finding small roots of bivariate polynomials
over the integers. In Proceedings of Eurocrypt’05, volume 3494 of
Lecture Notes in Computer Science, pages 251–267, 2005.
[11] D. Boneh. Twenty years of attacks on the RSA cryptosystem. Notices of the
AMS, 46:203–213, 1999.
[12] D. Boneh. Finding smooth integers in short intervals using CRT decoding.
In Proceedings of STOC’00, pages 265–272, 2000.
[13] D. Boneh. Finding smooth integers in short intervals using CRT decoding.
Journal of Computer and System Sciences, 64(4):768–784, 2002.
[14] D. Boneh and G. Durfee. Cryptanalysis of RSA with private key less than
N 0.292 . In Proceedings of Eurocrypt’99, volume 1592 of Lecture Notes in
Computer Science, pages 1–11, 1999.
[15] D. Boneh and G. Durfee. Cryptanalysis of RSA with private key d less than
N 0.292 . IEEE Transactions on Information Theory, 46:1339–1349, 2000.
[16] D. Boneh, G. Durfee, and Y. Frankel. An attack on RSA given a small
fraction of the private key bits. In Proceedings of Asiacrypt’98, volume 1514
of Lecture Notes in Computer Science, pages 25–34, 1998.
[17] D. Boneh, G. Durfee, and N. Howgrave-Graham. Factoring n = p r q for large
r. In Proceedings of Crypto’99, volume 1666 of Lecture Notes in Computer
Science, pages 326–337, 1999.
[18] D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to
factoring. In Proceedings of Eurocrypt’98, volume 1403 of Lecture Notes in
Computer Science, pages 59–71, 1998.
[19] D. R. L. Brown. Breaking RSA may be as difficult as factoring. Cryptology
ePrint Archive, Report 2005/380, 2005. Available at http://eprint.iacr.
org/.