An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems

Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to the general multidimensional DLP. An important component of the algorithm is a multidimensional pseudorandom walk which we analyse thoroughly in the 1 and 2 dimensional cases as well as giving some discussion for higher dimensions.

• Type: Conference
• Year: 2009
• Where: IMA
• Authors: Steven D. Galbraith, Raminder S. Ruprai
• Keywords: 2-dimensional Discrete Logarithm, Cryptography, General Multidimensional Dlp, IMA 2009, Multidimensional Pseudorandom Walk