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