Pages that link to "Item:Q908042"
From MaRDI portal
The following pages link to Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042):
Displaying 11 items.
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- New results on quasi-subfield polynomials (Q1979951) (← links)
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
- Still wrong use of pairings in cryptography (Q2335138) (← links)
- On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ (Q2980869) (← links)
- On the discrete logarithm problem in finite fields of fixed characteristic (Q4604404) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) (← links)
- Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms (Q6584318) (← links)
- MPC in the head using the subfield bilinear collision problem (Q6648188) (← links)
