Pages that link to "Item:Q1783724"
From MaRDI portal
The following pages link to Indiscreet logarithms in finite fields of small characteristic (Q1783724):
Displaying 10 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)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
- On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
- A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms (Q5380102) (← links)
- Cryptography and Coding (Q5428162) (← links)
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic (Q5862178) (← links)
- Roots of certain polynomials over finite fields (Q6166735) (← links)
- Cryptographic group and semigroup actions (Q6580111) (← links)