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

  • Steven Galbraith
  • Raminder S. Ruprai
Conference paper

DOI: 10.1007/978-3-642-10868-6_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5921)
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

Abstract

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.

Keywords

discrete logarithm problem (DLP) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Steven Galbraith
    • 1
  • Raminder S. Ruprai
    • 2
  1. 1.Mathematics DepartmentAuckland UniversityAucklandNew Zealand
  2. 2.Mathematics DepartmentRoyal Holloway University of LondonEghamUK

Personalised recommendations