Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
From MaRDI portal
Publication:3562909
DOI10.1007/978-3-642-13013-7_22zbMath1270.11124OpenAlexW2168139972WikidataQ61914040 ScholiaQ61914040MaRDI QIDQ3562909
Raminder S. Ruprai, Steven D. Galbraith
Publication date: 28 May 2010
Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_22
elliptic curvesnegation mapDiscrete Logarithm Problem (DLP)efficiently computable group homomorphisms
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
Reducing the Key Size of Rainbow Using Non-commutative Rings, Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox, Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm, A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity, A non-uniform birthday problem with applications to discrete logarithms, Recent progress on the elliptic curve discrete logarithm problem, ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION, О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом, Computational hardness of IFP and ECDLP, Computing discrete logarithms in an interval, Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem, Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms, Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms, Computing Interval Discrete Logarithm Problem with Restricted Jump Method
