Pages that link to "Item:Q2096515"

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

Displaying 10 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)
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms (Q2938855) (← links)
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields (Q2948326) (← links)
• (Q3154878) (← links)
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом (Q5152389) (← links)
• Parameterized Splitting Systems for the Discrete Logarithm (Q5281511) (← links)
• Cryptography and Coding (Q5428162) (← links)
• A survey of elliptic curves for proof systems (Q6063127) (← links)
• A new perspective on the powers of two descent for discrete logarithms in finite fields (Q6165875) (← links)