The following pages link to (Q4737507):
Displaying 14 items.
- Genus 2 point counting over prime fields (Q412199) (← 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)
- Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields (Q2389874) (← 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)
- Explicit bounds and heuristics on class numbers in hyperelliptic function fields (Q2781230) (← links)
- A generic approach to searching for Jacobians (Q3055104) (← links)
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields (Q3627456) (← links)
- Impact of Group Theory in Cryptosystem (Q5050167) (← links)
- Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox (Q5071233) (← links)
- Hasse–Witt and Cartier–Manin matrices: A warning and a request (Q5236835) (← links)
- Point counting on Picard curves in large characteristic (Q5315429) (← links)
- Counting points on curves and Abelian varieties over finite fields (Q5945287) (← links)
