A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
From MaRDI portal
Publication:2414928
DOI10.1007/S10623-018-0492-3zbMath1439.11299OpenAlexW2805855693WikidataQ129800084 ScholiaQ129800084MaRDI QIDQ2414928
Yuqing Zhu, Hairong Yi, Jincheng Zhuang, Chang Lv, Dong-Dai Lin
Publication date: 17 May 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-018-0492-3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Related Items (2)
Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms ⋮ Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
Cites Work
- Unnamed Item
- 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 low-memory algorithm for point counting on Picard curves
- On random walks for Pollard's rho method
- Families of Fast Elliptic Curves from ℚ-curves
- On Diffie-Hellman Key Agreement with Short Exponents
- Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
- Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
- An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
- Monte Carlo Methods for Index Computation (mod p)
- Improving the parallelized Pollard lambda search on anomalous binary curves
- Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
- Computing discrete logarithms in an interval
- On the Use of the Negation Map in the Pollard Rho Method
- Solving Discrete Logarithms from Partial Knowledge of the Key
- Algorithmic Number Theory
This page was built for publication: A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
