Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012, Article ID 635909, 15 pages
http://dx.doi.org/10.1155/2012/635909
Research Article

An Efficient Collision Detection Method for Computing Discrete Logarithms with Pollard's Rho

School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China

Received 7 July 2011; Revised 15 November 2011; Accepted 21 November 2011

Academic Editor: Jacek Rokicki

Copyright © 2012 Ping Wang and Fangguo Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644–654, 1976. View at Google Scholar · View at Zentralblatt MATH
  2. 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. FIPS 186-2, “Digital signature standard,” Tech. Rep. 186-2, Federal Information Processing Standards Publication, 2000. View at Google Scholar
  4. C. P. Schnorr, “Efficient signature generation by smart cards,” Journal of Cryptology, vol. 4, no. 3, pp. 161–174, 1991. View at Publisher · View at Google Scholar · View at Scopus
  5. N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of Computation, vol. 48, no. 177, pp. 203–209, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. V. Miller, “Use of elliptic curves in cryptography,” in Advances in Cryptology: Proceedings of Crypto'85, vol. 218 of LNCS, pp. 417–426, Springer, New York, NY, USA, 1986. View at Google Scholar
  7. A. Menezes, P. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, Fla, USA, 1996.
  8. J. M. Pollard, “Monte Carlo methods for index computation mod p,” Mathematics of Computation, vol. 32, no. 143, pp. 918–924, 1978. View at Google Scholar · View at Zentralblatt MATH
  9. R. Gallant, R. Lambert, and S. Vanstone, “Improving the parallelized Pollard lambda search on anomalous binary curves,” Mathematics of Computation, vol. 69, no. 232, pp. 1699–1705, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. M. Wiener and R. Zuccherato, “Faster attacks on elliptic curve cryptosystems,” in Selected Areas in Cryptography'98, vol. 1556 of LNCS, pp. 190–200, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. P. van Oorschot and M. Wiener, “Parallel collision search with cryptanalytic applications,” Journal of Cryptology, vol. 12, no. 1, pp. 1–28, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. R. P. Brent, “An improved Monte Carlo factorization algorithm,” BIT, vol. 20, no. 2, pp. 176–184, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. G. Nivasch, “Cycle detection using a stack,” Information Processing Letters, vol. 90, no. 3, pp. 135–140, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. J. J. Quisquater and J. P. Delescaille, “How easy is collision search? Application to DES,” in Proceedings of the Advances in Cryptology—Eurocrypt, vol. 434 of Lecture Notes in Computer Science, pp. 429–434, Springer, New York, NY, USA, 1989.
  15. J. J. Quisquater and J. P. Delescaille, “How easy is collision search. New results and applications to DES,” in Proceedings of the Advances in Cryptology—Crypto, vol. 435 of Lecture Notes in Computer Science, pp. 408–413, Springer, New York, NY, USA, 1989.
  16. M. E. Hellman, “A cryptanalytic time-memory trade-off,” IEEE Transactions on Information Theory, vol. 26, no. 4, pp. 401–406, 1980. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  17. B. Harris, “Probability distributions related to random mappings,” Annals of Mathematical Statistics, vol. 31, pp. 1045–1062, 1960. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  18. S. C. Pohlig and M. E. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance,” IEEE-Transactions on Information Theory, vol. 24, no. 1, pp. 106–110, 1978. View at Google Scholar · View at Zentralblatt MATH
  19. E. Teske, “Speeding up Pollard's rho method for computing discrete logarithms,” in Algorithmic Number Theory Symposium (ANTS IV), vol. 1423 of LNCS, pp. 541–553, Springer, New York, NY, USA, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  20. S. Bai and R. P. Brent, “On the efficiency of Pollard’s rho method for discrete logarithms,” in CATS 2008, J. Harland and P. Manyem, Eds., pp. 125–131, Australian Computer Society, 2008. View at Google Scholar
  21. C.-P. Schnorr and H. W. Lenstra Jr., “A Monte Carlo factoring algorithm with linear storage,” Mathematics of Computation, vol. 43, no. 167, pp. 289–311, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. E. Teske, “A space efficient algorithm for group structure computation,” Mathematics of Computation, vol. 67, no. 224, pp. 1637–1663, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  23. D. V. Bailey, L. Batina, D. J. Bernstein et al., “Breaking ECC2K-130,” Tech. Rep. 2009/541, Cryptology ePrint Archive, 2009. View at Google Scholar
  24. J. M. Pollard, “A Monte Carlo method for factorization,” BIT, vol. 15, no. 3, pp. 331–335, 1975. View at Google Scholar · View at Zentralblatt MATH
  25. D. E. Knuth, The Art of Computer Programming, vol. 2, Addison-Wesley, Reading, Mass, USA, 3rd edition, 1997.
  26. R. P. Brent, “Parallel algorithms for integer factorisation,” in Number Theory and Cryptography, J. H. Loxton, Ed., vol. 154 of London Mathematical Society Lecture Note Series, pp. 26–37, Cambridge University, Cambridge, UK, 1990. View at Google Scholar · View at Zentralblatt MATH
  27. “SAGE: an open source mathematics software,” http://www.sagemath.org/.
  28. D. E. Knuth, The Art of Computer Programming, vol. 3, Addison-Wesley, Reading, Mass, USA, 2nd edition, 1981.
  29. E. Teske, “On random walks for Pollard's rho method,” Mathematics of Computation, vol. 70, no. 234, pp. 809–825, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH