dissertacao.pdf

5 Bibliography
[1] Kamilah Abdullah, Comparison between the RSA Cryptosystem and Ellip-
tic Curve Cryptography, Master’s thesis, University of Waikato, 1998.
[2] Manindra Agrawal, Primality Tests Based on Fermat’s Little Theorem,
ICDCN, 2006, pp. 288–293.
[3] J Blomer and A. May, Low Secret Exponent RSA Revisited, Lecture Notes
in Computer Science (2001).
[4] Dan Boneh, Twenty Years of Attacks on the RSA Cryptosystem, Notices
of the American Mathematical Society (1999).
[5] Richard P. Brent, Recent Progress and Prospects for Integer Factorisation
Algorithms, Proceeding COCOON ’00 Proceedings of the 6th Annual In-
ternational Conference on Computing and Combinatorics (2000).
[6] Matthew E. Briggs, An Introduction to the General Number Field Sieve,
Master’s thesis, Virginia Polytechnic Institute and State University, 1998.
[7] Daniel R. L. Brown, A Weak-Randomizer Attack on RSA-OAEP with e =
3, 2005.
[8] Carlos Frederico Cid, Cryptanalysis of RSA: A Survey, Information Secu-
rity Reading Room (1988).
[9] D. Coppersmith, Small Solutions to Polynomial Equations, and Low Expo-
nent RSA Vulnerabilities, Journal of Cryptology (1997).
[10] G Durfee D Boneh and Y Frankel, An Attack on RSA Given a Small Frac-
tion of the Private Key Bits, Lecture Notes in Computer Science (1998).
[11] Tania Lange Daniel J. Bernstein, Peter Birkner and Christiane Peters, ECM
using Edwards Curves, Journal of Cryptology (2010).
[12] J. M. DeLaurentis, A Further Weakness in the Common Modulus Protocol
for the RSA Cryptoalgorithm, Cryptologia (1984).
52