1 |
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms, Section 31.7 The RSA Public-key Cryptosystem", 2nd Ed., MIT Press and McGraw-Hill. pp. 881-887, 2001.
|
2 |
D. R. Stinson, "Cryptography: Theory and Practice," 3rd ed., London, CRC Press, 2006.
|
3 |
D. Shanks, "The Infrastructure of a Real Quadratic Field and its Applications," Proceedings of the 1972 Number Theory Conference, University of Colorado, Boulder, 1972.
|
4 |
E. Teske, "Speeding Up Pollard's Rho Method for Computing Discrete Logarithms," Lecture Notes in Computer Science, Vol. 1423, pp. 541-554, Jun. 1998.
|
5 |
S. Bai and R. P. Brent, "On the Efficiency of Pollard's Rho Method for Discrete Logarithms," Computing: The Australasian Theory Symposium (CATS), Vol. 77, pp. 125-131, Jan. 2008.
|
6 |
A. Stein and E. Teske, "Optimized Baby step-Giant step Methods," Journal of the Ramanujan Mathematical Society, Vol. 20, No. 1, pp. 1-32, Jan. 2005.
|
7 |
D. C. Terr, "A modification of Shanks' Baby-step Giant-step algorithm," Mathematics of Computation, Vol. 69, No. 230, pp. 767-773, Mar. 1999.
DOI
ScienceOn
|
8 |
S. U. Lee, "Baby-Step Adult-Step Algorithm for Discrete Logarithm," Journal of KIIT, Vol. 11, No. 10, pp. 121-128, Oct. 2013.
|
9 |
J. H. Cheon, J. Hong, and M. K. Kim, "Accelerating Pollard's Rho Algorithm on Finite Fields", Journal of Cryptography, pp. 1-48, 2010.
|
10 |
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms, Section 25.2, The Floyd-Warshall Algorithms", 2nd Ed., MIT Press and McGraw-Hill. pp. 629-632, 2001.
|
11 |
A. Shamir, "Random Graphs in Cryptography", 7th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Algorithms, 2007.
|