Pages that link to "Item:Q3562909"
From MaRDI portal
The following pages link to Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval (Q3562909):
Displaying 14 items.
- A non-uniform birthday problem with applications to discrete logarithms (Q427899) (← links)
- Computational hardness of IFP and ECDLP (Q505664) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms (Q2059908) (← links)
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms (Q2068384) (← links)
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm (Q2408279) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- Reducing the Key Size of Rainbow Using Non-commutative Rings (Q2889995) (← links)
- Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem (Q3383117) (← links)
- Computing discrete logarithms in an interval (Q4912022) (← links)
- Computing Interval Discrete Logarithm Problem with Restricted Jump Method (Q4988923) (← links)
- Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox (Q5071233) (← links)
- ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION (Q5150693) (← links)
- О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом (Q5152389) (← links)
