The following pages link to The Tower Number Field Sieve (Q2795965):
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)
- 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)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← 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)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Individual discrete logarithm with sublattice reduction (Q6070357) (← 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)
