dissertacao.pdf

[13] Whitfield Diffie and Martin E. Hellman, New Directions in Cryptography,
IEEE Transactions on Information Theory (1976).
[14] ANDREJ DUJELLA, Continued Fractions and RSA with Small Secret Ex-
ponent, Tatra Mt. Math. Publ (2004).
[15] D Boneh G Durfee and Y Frankel, Exposing an RSA Private Key Given a
Small Fraction of its Bits, Journal of Cryptology (2001).
[16] Glenn Durfee, Cryptanalysis of RSA Using Algebraic and Lattice Methods,
Ph.D. thesis, Stanford University, 2002.
[17] M. K. Franklin and M. K. Reiter, A Linear Protocol Failure for RSA with
Exponent Three, CRYPTO ’95 rump session (1995).
[18] J. Hastad, On using RSA with Low Exponent in a Public Key Network,
Lecture Notes in Computer Science (1985).
[19] M Jason Hinek, Low Public Exponent Partial Key and Low Private Expo-
nent Attacks on Multi-prime RSA, Master’s thesis, University of Waterloo,
2002.
[20] M. Jason Hinek, Another Look at Small RSA Exponents, 2006.
[21] M Jason Hinek, On the Security of Some Variants of RSA, Ph.D. thesis,
University of Waterloo, 2007.
[22] M. Jason Hinek, Cryptanalysis of RSA and its Variants, Chapman Hall,
2010.
[23] M. Jason Hinek and Charles C. Y. Lam, Common Modulus Attacks on
Small Private Exponent RSA and Some Fast Variants (in Practice), IACR
Cryptology ePrint Archive 2009 (2009), 37.
[24] Abdullah Darwish Imad Khaled Salah and Saleh Oqeili, Mathematical At-
tacks on RSA Cryptosystem, Journal of Computer Science (2006).
[25] S. Katzenbeisser, Recent Advances in RSA Cryptography, Klewer Academic
Publishers (2001).
[26] A.K. Lenstra, H.W.jun. Lenstra, and Lászlo Lovász, Factoring Polynomials
With Rational Coefficients, Math. Ann. 261 (1982), 515–534.
53