Pages that link to "Item:Q2512887"

The following pages link to Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography (Q2512887):

Displayed 8 items.

• Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) ‎ (← links)
• 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)
• Updating key size estimations for pairings (Q2010589) ‎ (← links)
• New discrete logarithm computation for the medium prime case using the function field sieve (Q2158232) ‎ (← links)
• Faster initial splitting for small characteristic composite extension degree fields (Q2302583) ‎ (← links)
• Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) ‎ (← links)
• ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) ‎ (← links)