The following pages link to (Q4737504):
Displaying 12 items.
- A comparison of MNT curves and supersingular curves (Q862563) (← links)
- Index calculus in the trace zero variety (Q895005) (← links)
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity (Q908042) (← links)
- Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) (← links)
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
- A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
- The Function Field Sieve in the Medium Prime Case (Q3593100) (← links)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- Selecting polynomials for the Function Field Sieve (Q5501157) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
