Computing discrete logarithms in an interval

Mathematics of Computation

Volumn 82, Issue 282, 2013, Pages 1181-1195

  Galbraith, Steven D ^a   Pollard, John M ^b   Ruprai, Raminder S ^c  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b not available   (United Kingdom)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Discrete logarithm problem (DLP); Random walks

Indexed keywords

EID: 84873263896     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-2012-02641-X     Document Type: Article

References (21)

1. D. Boneh, E.-J. Goh and K. Nissim, Evaluating 2-DNF Formulas on Ciphertexts, in J. Kilian (ed.), TCC 2005, Springer LNCS 3378 (2005) 325-341.
2. J. H. Cheon, Security Analysis of the Strong Diffie-Hellman Problem, in S. Vaudenay (ed.), EUROCRYPT 2006, Springer LNCS 4004 (2006) 1-11.
3. S. D. Galbraith and R. S. Ruprai, An improvement to the Gaudry-Schost algorithm for multidimensional discrete logarithm problems, in M. Parker (ed.), Twelfth IMA International Conference on Cryptography and Coding, Cirencester, Springer LNCS 5921 (2009) 368-382.
4. S. D. Galbraith and R. S. Ruprai, Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval, in P. Q. Nguyen and D. Pointcheval (eds.), PKC 2010, Springer LNCS 6056 (2010) 368-383.
5. S. D. Galbraith and M. Holmes, A non-uniform birthday problem with applications to discrete logarithms, to appear in Discrete Applied Mathematics (2012).
6. P. Gaudry and E. Schost, A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm, in D. A. Buell (ed.), ANTS VI, Springer LNCS 3076 (2004) 208-222.
7. R. Gennaro, An Improved Pseudo-random Generator Based on Discrete Log, in M. Bellare (ed.), CRYPTO 2000, Springer LNCS 1880 (2000) 469-481.
8. K. Gopalakrishnan, N. Thériault, and C. Z. Yao, Solving Discrete Logarithms from Partial Knowledge of the Key, in K. Srinathan, C. P. Rangan, and M. Yung, (eds.), INDOCRYPT 2007, Springer LNCS 4859 (2007) 224-237.
9. D. Jao and K. Yoshida, Boneh-Boyen signatures and the Strong Diffie-Hellman problem, in H. Shacham and B. Waters (eds.), Pairing 2009, Springer LNCS 5671 (2009) 1-16.
10. C. H. Lim and P. J. Lee, A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroup, in B. S. Kaliski Jr. (ed.), CRYPTO 1997, Springer LNCS 1294 (1997) 249-263.
11. R. Montenegro and P. Tetali, How long does it take to catch a wild kangaroo? STOC 2009, ACM (2009) 553-560.
12. R. Montenegro, Remarks about random walks in the Gaudry-Schost algorithm, Emails, 4 January and 5 January 2011.
13. S. Patel and G. Sundaram, An Efficient Discrete Log Pseudo Random Generator, in H. Krawczyk (ed.), CRYPTO 1998, Springer LNCS 1462 (1998) 304-317.
14. S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance, IEEE Trans. Inf. Theory, 24 (1978) 106-110.
15. J. M. Pollard, Monte Carlo methods for index computation mod p, Mathematics of Computation, 32, No. 143 (1978) 918-924.
16. J. M. Pollard, Kangaroos, Monopoly and discrete logarithms, Journal of Cryptology, 13 (2000) 437-447.
17. R. S. Ruprai, Improvements to the Gaudry-Schost Algorithm for Multidimensional discrete logarithm problems and Applications, PhD thesis, Royal Holloway University of London, 2009.
18. B. I. Selivanov, On waiting time in the scheme of random allocation of coloured particles, Discrete Math. Appl., 5, No. 1 (1995) 73-82.
19. P. C. van Oorschot and M. J. Wiener, Parallel collision search with application to hash functions and discrete logarithms, In ACM Conference on Computer and Communications Security, (1994) 210-218.
20. P. C. van Oorschot and M. J. Wiener, On Diffie-Hellman Key Agreement with Short Exponents, in U. M. Maurer (ed.), EUROCRYPT 1996, Springer LNCS 1070 (1996) 332-343.
21. P. C. van Oorschot and M. J. Wiener, Parallel collision search with cryptanalytic applications, Journal of Cryptology, 12 (1999) 1-28.