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

DOI10.1007/978-3-642-10868-6_22zbMath1233.11128OpenAlexW176147980WikidataQ61914042 ScholiaQ61914042MaRDI QIDQ3654629

Raminder S. Ruprai, Steven D. Galbraith

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

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

Related Items (8)

Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox ⋮ A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ A non-uniform birthday problem with applications to discrete logarithms ⋮ On the distribution of the coefficients of normal forms for Frobenius expansions ⋮ О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом ⋮ Computing discrete logarithms in an interval ⋮ Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem ⋮ Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms

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