The following pages link to Algorithmic Number Theory (Q5465621):
Displaying 18 items.
- Genus 2 point counting over prime fields (Q412199) (← links)
- A non-uniform birthday problem with applications to discrete logarithms (Q427899) (← links)
- On the distribution of the coefficients of normal forms for Frobenius expansions (Q634134) (← 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)
- A low-memory algorithm for point counting on Picard curves (Q2491278) (← links)
- Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates (Q3297479) (← links)
- Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem (Q3383117) (← links)
- Rigorous computation of the endomorphism ring of a Jacobian (Q4612571) (← links)
- Computing discrete logarithms in an interval (Q4912022) (← 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)
- Point counting on Picard curves in large characteristic (Q5315429) (← links)
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication (Q6165852) (← links)
