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 |
D. R. Stinson, "Cryptography: Theory and Practice," 3rd ed., London, CRC Press, 2006.
|
3 |
M. Alfred, P. C. Oorschot, and S. A. Vanstone, "Handbook of Applied Cryptography", CRC Press, 1996.
|
4 |
R. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM, Vol. 21, No. 2, pp. 120-126, 1978.
DOI
|
5 |
B. Raiter, "How the RSA Cipher Works", http://www.tutorialized.com/tutorial/How-the-RSA-Cipher-Works/42395, 2009.
|
6 |
K. Ford, "The Number of Solutions of ", Annals of Mathematics, Vol. 150, No. 1, pp. 283-311, 1999.
DOI
|
7 |
D. Boneh, "The Decision Diffie-Hellman Problem", Lecture Notes in Computer Science Vol.1423, pp. 48-63, 1998.
|
8 |
W. Diffie and M. E. Hellman, "New Directions in Cryptography", IEEE Trans. on Information Theory, Vol. IT-22, pp. 644-654, 1976.
|
9 |
T. ElGamal, "A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms", IEEE Transactions on Information Theory, Vol.31 No. 4, pp. 469-472. 1985.
DOI
|
10 |
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.
|
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
|