Pages that link to "Item:Q3137444"
From MaRDI portal
The following pages link to A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields (Q3137444):
Displaying 17 items.
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
- A shorter proof for an explicit formula for discrete logarithms in finite fields (Q947813) (← links)
- Information authentication in automated control systems based on finite groups with multidimensional cyclicity (Q1040545) (← links)
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem (Q1611366) (← links)
- Function field sieve method for discrete logarithms over finite fields (Q1854276) (← links)
- On the discrete logarithm problem for plane curves (Q1940471) (← links)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- A deterministic algorithm for the discrete logarithm problem in a semigroup (Q2154468) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- Algebraic groups and discrete logarithm (Q2764230) (← links)
- (Q3154878) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- Smooth ideals in hyperelliptic function fields (Q4529714) (← links)
- Using number fields to compute logarithms in finite fields (Q4955874) (← links)
- Parameterized Splitting Systems for the Discrete Logarithm (Q5281511) (← links)
- A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms (Q5380102) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
