Pages that link to "Item:Q5862178"

The following pages link to Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178):

Displaying 27 items.

• On the discrete logarithm problem in elliptic curves. II (Q380364) (← links)
• A shorter proof for an explicit formula for discrete logarithms in finite fields (Q947813) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). (Q1811103) (← links)
• New results on quasi-subfield polynomials (Q1979951) (← links)
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• Dynamic universal accumulator with batch update over bilinear groups (Q2152172) (← links)
• Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms (Q2938855) (← 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)
• On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
• (Q5150656) (← links)
• Parameterized Splitting Systems for the Discrete Logarithm (Q5281511) (← links)
• Advances in Cryptology – CRYPTO 2004 (Q5311533) (← 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)
• Tensors in computations (Q5887832) (← links)
• Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets (Q6051405) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• Individual discrete logarithm with sublattice reduction (Q6070357) (← 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)
• 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)