Pages that link to "Item:Q4955874"

The following pages link to Using number fields to compute logarithms in finite fields (Q4955874):

Displaying 15 items.

• A comparison of MNT curves and supersingular curves (Q862563) (← links)
• Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
• Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← 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)
• Refined analysis to the extended tower number field sieve (Q2304549) (← links)
• On the signature calculus for finite fields of order square of prime numbers (Q2436760) (← links)
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case (Q2835600) (← links)
• The multiple number field sieve for medium- and high-characteristic finite fields (Q2878838) (← links)
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm (Q2958114) (← links)
• A Brief History of Pairings (Q5267789) (← 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 and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)