Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms

DOI10.1007/S10623-021-00966-5zbMath1482.11162OpenAlexW3210434013MaRDI QIDQ2068384

Haoxuan Wu, Jincheng Zhuang

Publication date: 19 January 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-021-00966-5

zbMATH Keywords

discrete logarithm problemGaudry-Schost algorithmmultidimensional discrete logarithm problemtame and wild kangaroos

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-uniform birthday problem with applications to discrete logarithms
• Parallel collision search with cryptanalytic applications
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Mathematics of Public Key Cryptography
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
• An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Monte Carlo Methods for Index Computation (mod p)
• On waiting time in the scheme of random allocation of coloured particies
• Computing discrete logarithms in an interval
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• Algorithmic Number Theory

This page was built for publication: Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms