Random cayley digraphs and the discrete logarithm

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

Volumn 2369, Issue , 2002, Pages 416-430

  Horwitz, Jeremy ^a   Venkatesan, Ramarathnam ^b  

^a STANFORD UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GROUP THEORY; NUMBER THEORY; RANDOM PROCESSES;

ABELIAN GROUP; CAYLEY DIGRAPH; DISCRETE LOGARITHMS; LARGE GRAPHS; OPTIMAL TIME; RANDOM WALK;

ALGORITHMS;

EID: 67349275117     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45455-1_33     Document Type: Conference Paper

References (12)

1. N. Alon and Y. Roichman, “Random Cayley Graphs and Expanders.” Random Structures and Algorithms, 5:271–284, 1994.
2. E. Bach, “Toward a Theory of Pollard’s Rho Method.” Information and Computation, 90(2):139–155, 1991.
3. M. Bellare and J. Rompel, “Randomness-Efficient Oblivious Sampling.” Symposium on Foundations of Computer Science (FOCS’94):276–287, 1994.
4. B. Bollobas, Modern Graph Theory, Graduate Texts in Mathematics 184. Springer-Verlag, Berlin, 1998.
5. A. Broder and E. Shamir, “On the Second Eigenvalue of Random Regular Graphs.” Symposium on the Foundations of Computer Science (FOCS’87):286–294, 1987.
6. P. Erdos and A. Rényi, “Probabilistic Methods in Group Theory.” Journal d’Analyse Mathématique, 14:127–138, 1965.
7. 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.
8. J.M. Pollard, “Monte Carlo Methods for Index Computation (mod p).” Mathematics of Computation, 32(143):918–924, 1978.
9. Y. Roichman, “On Random Random Walks.” Annals of Probability, 24(2):1001–1011, 1996.
10. V. Shoup, “Lower Bounds for Discrete Logarithms and Related Problems.” Advances in Cryptology: EUROCRYPT’97 (LNCS 1233):256–266, 1997.
11. E. Teske, “Speeding Up Pollard’s Rho Method for Computing Discrete Logarithms.” Algorithmic Number Theory Symposium III: ANTS-III (LNCS 1423):541–554, 1998.
12. E. Teske, “On Random Walks for Pollard’s Rho Method.” Mathematics of Computation, 70:809–825, 2001.