New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields

DOI10.1007/978-3-662-49890-3_17zbMath1385.11075OpenAlexW2408939312MaRDI QIDQ2820492

No author found.

Publication date: 9 September 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_17

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (14)

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 ⋮ Refined analysis to the extended tower number field sieve ⋮ 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: New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields