Advertisement

Random Walks Revisited: Extensions of Pollard’s Rho Algorithm for Computing Multiple Discrete Logarithms

  • Fabian Kuhn
  • René Struik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2259)

Abstract

This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more than one instance of the discrete logarithm problem in the same group G. We analyze Pollard’s rho algorithm when used to iteratively solve all the instances. We also analyze the situation when the goal is to solve any one of the multiple instances using any DLP algorithm.

Keywords

Group Operation Elliptic Curve Cyclic Group Distinguished Point Group Element 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    L. Adleman and J. De Marrais, A Subexponential Algorithm for Discrete Logarithms over All Finite Fields, in Advances of Cryptology—CRYPTO’93, D.R. Stinson, Ed., pp. 147–158, Lecture Notes in Computer Science, Vol. 773, Berlin: Springer, 1993.Google Scholar
  2. 2.
    L. Adleman, J. DeMarrais and M. Huang, A Subexponential Algorithm for Discrete Logarithms over the RationalSubgroup of the Jacobians of Large genus Hyperelliptic Curves over Finite Fields, in Algorithmic Number Theory, pp. 28–40, Lecture Notes in Computer Science, Vol. 877, Berlin: Springer, 1994.Google Scholar
  3. 3.
    R.P. Brent, An Improved Monte Carlo Factorization Algorithm, j-BIT, Vol. 20, No. 2, pp. 176–184, 1980.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    J.H. van Lint and R.M. Wilson, A Course in Combinatorics, Cambridge: Cambridge University Press, 1992.zbMATHGoogle Scholar
  5. 5.
    F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977.zbMATHGoogle Scholar
  6. 6.
    P.C. van Oorschot and M.J. Wiener, Parallel Collision Search with Cryptanalytic Applications, J. of Cryptology, Vol. 12, pp. 1–28, 1999.zbMATHCrossRefGoogle Scholar
  7. 7.
    S. Pohlig and M. Hellman, An Improved Algorithm for Computing Logarithms in GF(p) and its Cryptographic Signi.cance, IEEE Trans. Inform. Theory, Vol. IT-24, pp. 106–111, January 1978.CrossRefMathSciNetGoogle Scholar
  8. 8.
    J.M. Pollard, Monte Carlo Methods for Index Computation ( mod p), Mathematics of Computation, Vol. 32, No. 143, pp. 918–924, July 1978.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    E. Schulte-Geers, Collision Search in a Random Mapping: Some Asymptotic Results, presented at ECC 2000-The Fourth Workshop on Elliptic Curve Cryptography, University of Essen, Germany, October 4-6, 2000.Google Scholar
  10. 10.
    V. Shoup, Lower Bounds for Discrete Logarithms and Related Problems, in Advances in Cryptology—EUROCRYPT’ 97, W. Fumy, Ed., Lecture Notes in Computer Science, Vol. 1233, pp. 256–266, Berlin: Springer, 1997.Google Scholar
  11. 11.
    R. Silverman and J. Stapleton, Contribution to ANSI X9F1 working group, December 1997.Google Scholar
  12. 12.
    E. Teske, Speeding up Pollard’s Rho Method for Computing Discrete Logarithms, in Proceedings of ANTS III-The 3rd International Symposium on Algorithmic Number Theory, J.P. Buhler, Ed., Lecture Notes in Computer Science, Vol. 1423, pp. 351–357, Berlin: Springer, 1998.CrossRefGoogle Scholar
  13. 13.
    E. Teske, On Random Walks for Pollard’s Rho Method, Mathematics of Computation, Vol. 70, pp. 809–825, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    E. Teske, Square-Root Algorithms for the Discrete Logarithm Problem (A Survey), Technical Report CORR 2001-07, Centre for Applied Cryptographic Research, University of Waterloo, 2001.Google Scholar
  15. 15.
    M.J. Wiener and R.J. Zuccherato, Faster Attacks on Elliptic Curve Cryptosystems, in Proceedings of SAC’98-Fifth Annual Workshop on Selected Areas in Cryptography, E. Tavares, H. Meijer, Eds., Lecture Notes in Computer Science, Vol. 1556, pp. 190–200, Berlin: Springer, 1998.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Fabian Kuhn
    • 1
  • René Struik
    • 2
  1. 1.Departement InformatikETH ZentrumZürichSwitzerland
  2. 2.Certicom ResearchOntarioCanada

Personalised recommendations