The Tower Number Field Sieve
From MaRDI portal
Publication:2795965
DOI10.1007/978-3-662-48800-3_2zbMath1375.94096OpenAlexW2295494829MaRDI QIDQ2795965
Razvan Barbulescu, Thorsten Kleinjung, Pierrick Gaudry
Publication date: 23 March 2016
Published in: Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48800-3_2
Related Items (21)
Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ A survey of elliptic curves for proof systems ⋮ Individual discrete logarithm with sublattice reduction ⋮ Optimal generic attack against basic Boneh-Boyen signatures ⋮ A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Solving discrete logarithms on a 170-bit MNT curve by pairing reduction ⋮ Collecting relations for the number field sieve in ⋮ Faster individual discrete logarithms in finite fields of composite extension degree ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree ⋮ Updating key size estimations for pairings ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Refined analysis to the extended tower number field sieve ⋮ A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level ⋮ Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ A Brief History of Pairings
This page was built for publication: The Tower Number Field Sieve
