Pages that link to "Item:Q3593100"

The following pages link to The Function Field Sieve in the Medium Prime Case (Q3593100):

Displaying 17 items.

• On index calculus algorithms for subfield curves (Q832332) (← 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)
• Applications to cryptography of twisting commutative algebraic groups (Q1003699) (← links)
• On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field (Q1026985) (← links)
• Using abelian varieties to improve pairing-based cryptography (Q1027984) (← links)
• Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
• Elliptic periods and primality proving (Q1762314) (← links)
• Indiscreet logarithms in finite fields of small characteristic (Q1783724) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) (← links)
• Refined analysis to the extended tower number field sieve (Q2304549) (← links)
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887) (← links)
• Traps to the BGJT-algorithm for discrete logarithms (Q2878837) (← links)
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
• Selecting polynomials for the Function Field Sieve (Q5501157) (← links)