Speeding up pollard’s rho method for computing discrete logarithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1423, Issue , 1998, Pages 541-554

  Teske, Edlyn ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HARVESTING; NUMBER THEORY;

DEFINED FUNCTIONS; DISCRETE LOGARITHMS; ELLIPTIC CURVE; GROUP ORDER; PRE-COMPUTATION; REAL TIME; RHO METHODS; RUNTIMES;

COMPUTATION THEORY;

EID: 84947761194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054891     Document Type: Conference Paper

References (18)

1. O. Atkin. The number of points on an elliptic curve modulo a prime. Manuscript.
2. R. P. Brent. An improved Monte Carlo factorization algorithm. BIT, 20:176-184, 1980.
3. A. Greenhalgh. Random walks on groups with subgroup invariance properties. PhD thesis, Department of Mathematics, Stanford University, 1989.
4. M. V. Hildebrand. Random walks supported on the random points of Z/nZ. Probability Theory and Related Fields, 100:191-203, 1994.
5. D. E. Knuth. The art of computer programming. Volume 3: Sorting and searching. Addison-Wesley, Reading, Massachusetts, 1973.
6. N. Koblitz. A Course in Number Theory and Cryptography. Springer-Verlag, New York, 1987.
7. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203-209, 1987.
8. F. Lehmann, M. Maurer, V. Müller, and V. Shoup. eco - a tool for elliptic curve group order computations, 1997. TI, Technische Universität Darmstadt.
9. LiDIA Group, Technische Universität Darmstadt. LiDIA - A library for computational number theory. Available from http://www.informatik.tu-darmstadt.de/TI/LiDIA.
10. V. Miller. Uses of elliptic curves in cryptography. In Advances in Cryptology - CRYPTO '85, volume 218 of Lecture Notes in Computer Science, pages 417-426, 1986.
11. 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, 24:106-110, 1978.
12. J. M. Pollard. Monte Carlo methods for index computation (mod p). Mathematics of Computation, 32(143):918-924, 1978.
13. C. P. Schnorr and H. W. Lenstra, Jr. A Monte Carlo factoring algorithm with linear storage. Mathematics of Computation, 43(167):289-311, 1984.
14. D. Shanks. Class number, a theory of factorization and genera. In Proc. Symp. Pure Math. 20, pages 415-440. AMS, Providence, R.I., 1971.
15. J. Silverman. The arithmetic of elliptic curves. Springer-Verlag, 1986.
16. E. Teske. New algorithms for finite abelian groups. PhD thesis, Technische Universität Darmstadt, 1998.
17. E. Teske. A space efficient algorithm for group structure computation. To appear in Mathematics of Computation, 1998.
18. P. C. van Oorschot and M. J. Wiener. Parallel collision search with cryptanalytic applications. To appear in Journal of Cryptology.