Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

IMA
2009
Springer

favoriteEmaildiscussreport

131views Cryptology» more IMA 2009»

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

13 years 11 months ago

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

Download www.isg.rhul.ac.uk

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.

Steven D. Galbraith, Raminder S. Ruprai

Real-time Traffic

2-dimensional Discrete Logarithm | Cryptography | General Multidimensional Dlp | IMA 2009 | Multidimensional Pseudorandom Walk |

claim paper

Related Content

» Some babystep giantstep algorithms for the low hamming weight discrete logarithm problem

» Finding lowweight polynomial multiples using discrete logarithm

» Multisignatures secure under the discrete logarithm assumption and a generalized forking l...

» Cryptography in Quadratic Function Fields

» Index Calculus Attack for Hyperelliptic Curves of Small Genus

» Security Estimates for Quadratic Field Based Cryptosystems

» Compact routing on euclidian metrics

» Recent Progress and Prospects for Integer Factorisation Algorithms

» Better bounds on the union complexity of locally fat objects

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	IMA
Authors	Steven D. Galbraith, Raminder S. Ruprai

Comments (0)