Pages that link to "Item:Q2820492"
From MaRDI portal
The following pages link to New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields (Q2820492):
Displaying 18 items.
- The space complexity analysis in the general number field sieve integer factorization (Q278727) (← links)
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction (Q1698673) (← links)
- Computing discrete logarithms in \(\mathbb F_{p^6}\) (Q1746956) (← 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)
- A unified polynomial selection method for the (tower) number field sieve algorithm (Q2311609) (← 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)
- Faster individual discrete logarithms in finite fields of composite extension degree (Q4612570) (← 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)
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486) (← 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)
- Curves with Fast Computations in the First Pairing Group (Q6488030) (← links)
