Pages that link to "Item:Q4604404"

The following pages link to On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404):

Displaying 30 items.

• Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
• A shorter proof for an explicit formula for discrete logarithms in finite fields (Q947813) (← links)
• Discrete logarithms in \(\mathrm{GF}(p)\) (Q1094455) (← links)
• A note on cyclic groups, finite fields, and the discrete logarithm problem (Q1196516) (← 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)
• On the discrete logarithm problem (Q2344104) (← links)
• The discrete logarithm problem from a local duality perspective (Q2438539) (← links)
• Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields (Q2948326) (← links)
• Discrete logarithm in an arbitrary quotient ring of polynomials of one variable over a finite field (Q3064483) (← links)
• (Q3154878) (← links)
• (Q3635542) (← links)
• (Q4298421) (← links)
• Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
• (Q5150656) (← links)
• Advances in Cryptology – CRYPTO 2004 (Q5311533) (← links)
• A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms (Q5380102) (← links)
• On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic (Q5382575) (← links)
• Cryptography and Coding (Q5428162) (← 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)
• Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486) (← 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)
• Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms (Q6584318) (← links)