Pages that link to "Item:Q5738795"

The following pages link to Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree (Q5738795):

Displaying 17 items.

• Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← 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)
• Lattice sieving in three dimensions for discrete log in medium characteristic (Q2033517) (← links)
• A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields (Q2096515) (← links)
• Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
• Fast, compact, and expressive attribute-based encryption (Q2234469) (← links)
• Refined analysis to the extended tower number field sieve (Q2304549) (← links)
• Still wrong use of pairings in cryptography (Q2335138) (← links)
• Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
• Adequate Elliptic Curves for Computing the Product of n Pairings (Q5267791) (← links)
• Individual discrete logarithm with sublattice reduction (Q6070357) (← links)
• Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)
• Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
• Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation (Q6182003) (← links)