Pages that link to "Item:Q2949526"
From MaRDI portal
The following pages link to Solving a $$6120$$ -bit DLP on a Desktop Computer (Q2949526):
Displaying 13 items.
- Index calculus in the trace zero variety (Q895005) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Solving \(X^{q+1}+X+a=0\) over finite fields (Q1995227) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Almost perfect nonlinear trinomials and hexanomials (Q2011496) (← links)
- Complete solution over \(\mathbb{F}_{p^n}\) of the equation \(X^{p^k+1}+X+a=0\) (Q2238912) (← links)
- Faster initial splitting for small characteristic composite extension degree fields (Q2302583) (← links)
- A probabilistic analysis on a lattice attack against DSA (Q2329391) (← links)
- Point compression for the trace zero subgroup over a small degree extension field (Q2340180) (← links)
- On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
- Computation of a 30750-bit binary field discrete logarithm (Q4956935) (← links)
- Roots of certain polynomials over finite fields (Q6166735) (← links)
