The Number Field Sieve in the Medium Prime Case

DOI10.1007/11818175_19zbMath1161.11417OpenAlexW1578625033MaRDI QIDQ5756634

Antoine Joux, Frederik Vercauteren, Reynald Lercier, Nigel P. Smart

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11818175_19

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items

Trapdoor DDH groups from pairings and isogenies ⋮ Individual discrete logarithm with sublattice reduction ⋮ 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 ⋮ The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ 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 ⋮ Computing Generator in Cyclotomic Integer Rings ⋮ Updating key size estimations for pairings ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Indiscreet logarithms in finite fields of small characteristic ⋮ Lattice sieving in three dimensions for discrete log in medium characteristic ⋮ Subexponential time relations in the class group of large degree number fields ⋮ ECM on Graphics Cards ⋮ Refined analysis to the extended tower number field sieve ⋮ Some mathematical remarks on the polynomial selection in NFS ⋮ Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case ⋮ An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$ ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ A Brief History of Pairings ⋮ Traps to the BGJT-algorithm for discrete logarithms ⋮ The multiple number field sieve for medium- and high-characteristic finite fields ⋮ Subexponential class group and unit group computation in large degree number fields