Pages that link to "Item:Q4604404"
From MaRDI portal
The following pages link to On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404):
Displaying 13 items.
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Factor base discrete logarithms in Kummer extensions (Q1654504) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Refined analysis to the extended tower number field sieve (Q2304549) (← links)
- Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
- A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms (Q5380102) (← links)
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178) (← links)
- Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets (Q6051405) (← links)
- A new perspective on the powers of two descent for discrete logarithms in finite fields (Q6165875) (← links)
- Roots of certain polynomials over finite fields (Q6166735) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)
