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

DOI10.1007/978-3-642-10868-6_22MaRDI QIDQ3654629zbMATH OpenOpenAlexWikidataFDO

Authors Steven D. Galbraith, Raminder S. Ruprai

Publication date 7 January 2010

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10868-6_22

zbMATH Keywords

discrete logarithm problem (DLP)

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
• A new approach to the discrete logarithm problem with auxiliary inputs
• A general framework for subexponential discrete logarithm algorithms
• Improved Pollard rho method for computing discrete logarithms over finite extension fields
• An algorithm for solving the discrete log problem on hyperelliptic curves
• A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms

Cited in

(11)

• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• Computing discrete logarithms in an interval
• A non-uniform birthday problem with applications to discrete logarithms
• Improving the DISPGB algorithm using the discriminant ideal
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Extending Regev's quantum algorithm to elliptic curves
• On the distribution of the coefficients of normal forms for Frobenius expansions
• On the complexity of two-dimensional discrete logarithm problem in a finite cyclic group with effective automorphism of order 6
• Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
• Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox

This page was built for publication: An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3654629)