Collision of random walks and a refined analysis of attacks on the discrete logarithm problem

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

Volumn 9020, Issue , 2015, Pages 127-149

  Kijima, Shuji ^a   Montenegro, Ravi ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b University of Massachusetts Lowell   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; HEURISTIC METHODS; MARKOV PROCESSES; PUBLIC KEY CRYPTOGRAPHY;

DISCRETE LOGARITHM PROBLEMS; DISCRETE LOGARITHMS; EXPECTED TIME; LOWER BOUNDS; PARALLEL VERSION; PSEUDO RANDOM; REFINED ANALYSIS; UPPER AND LOWER BOUNDS;

ALGORITHMS;

EID: 84925237579     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-46447-2_6     Document Type: Conference Paper

References (19)

1. Bailey, D., Batina, L., Bernstein, D., Birkner, P., Bos, J., Chen, H.-C., Cheng, C.-M., Van Damme, G., de Meulenaer, G., Perez, L.J.D., Fan, J., Güneysu, T., Gürkaynak, F., Kleinjung, T., Lange, T., Mentens, N., Niederhagen, R., Paar, C., Regazzoni, F., Schwabe, P., Uhsade, L., Van Herrewege, A., Yang, B-Y.: “Breaking ECC2K-130,” Cryptology ePrint Archive, Report 2009/541 (2009). https://eprint.iacr.org/2009/541
2. Bernstein, D.J., Lange, T.: Two grumpy giants and a baby. In: ANTS X: Proceedings of the 10th International Symposium on Algorithmic Number Theory. Mathematical Sciences Publishers (2013)
3. Blackburn, S., Scott, S.: The discrete logarithm problem for exponents of bounded height. In: ANTS XI: Proceedings of the 11th International Symposium on Algorithmic Number Theory. LMS J. Comput. Math 17, 148–156 (2014)
4. Blackburn, S., Murphy, S.: The number of partitions in Pollard Rho, Unpublished note: Later made available as Technical report RHUL-MA-2011-11 Department of Mathematics, p. 2011. University of London, Royal Holloway (1998)
5. Galbraith, S.D., Pollard, J.M., Ruprai, R.S.: Computing discrete logarithms in an interval. Math. Comp. 82, 1181–1195 (2013)
6. Galbraith, S., Ruprai, R.S.: An improvement to the Gaudry-Schost algorithm for multidimensional discrete logarithm problems. In: Parker, M.G. (ed.) Cryptography and Coding 2009. LNCS, vol. 5921, pp. 368–382. Springer, Heidelberg (2009)
7. Gaudry, P., Schost, é.: A low-memory parallel version of Matsuo, Chao, and Tsujii’s algorithm. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol. 3076, pp. 208–222. Springer, Heidelberg (2004)
8. Hildebrand, M.: On the Chung-Diaconis-Graham random process. Electron. Comm. Probab. 11, 347–356 (2006)
9. Kim, J-H., Montenegro, R., Tetali, P.: Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. In: IEEE Proc. of the Symposium on Foundations of Computer Science (FOCS 2007), pp. 215–223 (2007)
10. Kim, J.-H., Montenegro, R., Peres, Y., Tetali, P.: A Birthday Paradox for Markov chains, with an optimal bound for collision in the Pollard Rho Algorithm for Discrete Logarithm. The Annals of Applied Probability 20(2), 495–521 (2010)
11. Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation 8(1), 3–30 (1998)
12. Miller, S.D., Venkatesan, R.: Spectral analysis of Pollard rho collisions. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 573–581. Springer, Heidelberg (2006)
13. Montenegro, R., Tetali, P.: How long does it take to catch a wild kangaroo?. In: Proc. of 41st ACM Symposium on Theory of Computing (STOC 2009), pp. 553–559 (2009). Citations refer to an improved version at http://arxiv.org/pdf/0812.0789v2.pdf
14. Nishimura, K., Shibuya, M.: Probability to meet in the middle. Journal of Cryptology 2(1), 13–22 (1990)
15. Pollard, J.: Monte Carlo methods for index computation mod p. Mathematics of Computation 32(143), 918–924 (1978)
16. Pollard, J.: Kangaroos, Monopoly and Discrete Logarithms. Journal of Cryptology 13(4), 437–447 (2000)
17. Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256–266. Springer, Heidelberg (1997)
18. Teske, E.: Speeding up Pollard’s rho method for computing discrete logarithms. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 541–554. Springer, Heidelberg (1998)
19. Rosini, M.D.: Applications. In: Rosini, M.D. (ed.) Macroscopic Models for Vehicular Flows and Crowd Dynamics: Theory and Applications. UCS, vol. 12, pp. 217–226. Springer, Heidelberg (2013)