Cryptanalysis of RSA Factorization - Library(ISI Kolkata) - Indian ...
Cryptanalysis of RSA Factorization - Library(ISI Kolkata) - Indian ...
Cryptanalysis of RSA Factorization - Library(ISI Kolkata) - Indian ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
161 BIBLIOGRAPHY<br />
[42] M. K. Franklin and M. K. Reiter. A linear protocol failure for <strong>RSA</strong> with<br />
exponent three. Crypto’95 Rump Session, 1995.<br />
[43] Free S<strong>of</strong>tware Foundation, Inc. GMP: The GNU Multiple Precision Arithmetic<br />
<strong>Library</strong>. Available at http://gmplib.org/.<br />
[44] S. Goldwasser and J. Kilian. Primality testing using elliptic curves. Journal<br />
<strong>of</strong> the ACM, 46(4):450–472, 1999.<br />
[45] S. Goldwasser and S. Micali. Probabilistic encryption. Journal <strong>of</strong> Computer<br />
and System Sciences, 28:450–472, 1984.<br />
[46] J. A. Halderman, S. D. Schoen, N. Heninger, W. Clarkson, W. Paul, J. A.<br />
Calandrino, A. J. Feldman, J. Appelbaum, and E. W. Felten. Lest we remember:<br />
cold-boot attacks on encryption keys. Commun. ACM, 52(5):91–<br />
98, 2009.<br />
[47] G. H. Hardy and E. M. Wright. An Introduction to the Theory <strong>of</strong> Numbers.<br />
Oxford University Press, USA, 1960.<br />
[48] J. Håstad. On using <strong>RSA</strong> with low exponent in a public key network. In<br />
Proceedings <strong>of</strong> Crypto’85, volume 218 <strong>of</strong> Lecture Notes in Computer Science,<br />
pages 403–408, 1986.<br />
[49] J. Håstad. Solving simultaneous modular equations <strong>of</strong> low degree. SIAM<br />
Journal on Computing, 17(2):336–341, 1988.<br />
[50] N.HeningerandH.Shacham. Reconstructing<strong>RSA</strong>privatekeysfromrandom<br />
key bits. In Proceedings <strong>of</strong> Crypto’09, volume 5677 <strong>of</strong> Lecture Notes in<br />
Computer Science, pages 1–17, 2009.<br />
[51] M. Herrmann and A. May. Solving linear equations modulo divisors: On<br />
factoring given any bits. In Proceedings <strong>of</strong> Asiacrypt’08, volume 5350 <strong>of</strong><br />
Lecture Notes in Computer Science, pages 406–424, 2008.<br />
[52] M. J. Hinek. Another look at small <strong>RSA</strong> exponents. In Proceedings <strong>of</strong> CT-<br />
<strong>RSA</strong>’06, volume 3860 <strong>of</strong> Lecture Notes in Computer Science, pages 82–98,<br />
2006.<br />
[53] M.J.Hinek. On the security <strong>of</strong> some variants <strong>of</strong> <strong>RSA</strong>. PhDthesis,University<br />
<strong>of</strong> Waterloo, Canada, 2007. Available at http://uwspace.uwaterloo.ca/<br />
handle/10012/2988.