1 |
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms," 2nd Ed., MIT Press and McGraw-Hill. pp. 887-896, 2001.
|
2 |
C. P. Schnorr, "Refined analysis and improvements on some factoring algorithms", Journal of Algorithms, Vol. 3, No. 2, pp. 101-127, 1982.
DOI
|
3 |
D. R. Stinson, "Cryptography: Theory and Practice," 3rd ed., London, CRC Press, 2006.
|
4 |
B. Raiter, "How the RSA Cipher Works", http://www.tutorialized.com/tutorial/How-the-RSA-Cipher-Works/42395, 2009.
|
5 |
M. Seysen, "A probabilistic factorization algorithm with quadratic forms of negative discriminant", Mathematics of Computation, Vol. 48, No. 178, pp. 757-780, 1987.
DOI
|
6 |
Wikipedia, "Integer Factorization," http://en.wikipedia.org/wiki/Integer_factorization, 2014.
|
7 |
Wikipedia, "RSA Factoring Challenge," http://en.wikipedia.org/wiki/RSA_Factoring_challenge, 2014.
|
8 |
K. Ford, "The Number of Solutions of (x)=m", Annals of Mathematics, Vol. 150, No. 1, pp. 283-311, 1999.
DOI
|
9 |
A. Stein and E. Teske, "Optimized Baby step-Giant step Methods," Journal of the Ramanujan Mathematical Society, Vol. 20, No. 1, pp. 1-32, 2005.
|
10 |
S. Bruce, "Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd ed.", Wiley, 1996.
|
11 |
D. C. Terr, "A modification of Shanks' Baby-step Giant-step algorithm," Mathematics of Computation, Vol. 69, pp. 767-773, 2000.
|
12 |
J. Pollard, "Monte Carlo methods for index computation mod p", Mathematics of Computation, Vol. 32, 1978.
|
13 |
A. A. Razborov and S. Rudich, "Natural proofs", Journal of Computer and System Sciences, Vol. 55, pp. 24-35, 1997.
DOI
ScienceOn
|
14 |
S. T. Klein, "Should One Always Use Repeated Squaring for Modular Exponentiation?", Information Processing Letters, Vol. 106, Issue. 6, pp. 232-237, 2008.
DOI
ScienceOn
|