Pages that link to "Item:Q4612570"
From MaRDI portal
The following pages link to Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570):
Displaying 10 items.
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Lattice sieving in three dimensions for discrete log in medium characteristic (Q2033517) (← links)
- Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
- Refined analysis to the extended tower number field sieve (Q2304549) (← links)
- A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups (Q2798621) (← 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)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486) (← links)
- Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)