An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
- Cite this paper as:
- Galbraith S., Ruprai R.S. (2009) An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems. In: Parker M.G. (eds) Cryptography and Coding. IMACC 2009. Lecture Notes in Computer Science, vol 5921. Springer, Berlin, Heidelberg
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.
Keywordsdiscrete logarithm problem (DLP)
Unable to display preview. Download preview PDF.