An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
From MaRDI portal
Publication:3654629
DOI10.1007/978-3-642-10868-6_22zbMath1233.11128WikidataQ61914042 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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
Computing discrete logarithms in an interval, Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox, О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом, A non-uniform birthday problem with applications to discrete logarithms, On the distribution of the coefficients of normal forms for Frobenius expansions, Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms, A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity, Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
