Pages that link to "Item:Q2878838"

The following pages link to The multiple number field sieve for medium- and high-characteristic finite fields (Q2878838):

Displaying 17 items.

• Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← links)
• Updating key size estimations for pairings (Q2010589) (← links)
• Lattice sieving in three dimensions for discrete log in medium characteristic (Q2033517) (← links)
• Everybody's a target: scalability in public-key encryption (Q2055664) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• Refined analysis to the extended tower number field sieve (Q2304549) (← links)
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
• Collecting relations for the number field sieve in (Q2971019) (← links)
• Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case (Q2976942) (← links)
• (Q4375601) (← links)
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields (Q4924410) (← links)
• ON BOUNDS FOR BALANCED EMBEDDING DEGREE (Q5150737) (← links)
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree (Q5738795) (← links)
• Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
• Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486) (← links)
• Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)