Pages that link to "Item:Q2096515"

The following pages link to Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515):

Displaying 3 items.

• 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)
• A survey of elliptic curves for proof systems (Q6063127) (← links)