The Number Field Sieve in the Medium Prime Case

From MaRDI portal
Publication:5756634

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




Related Items

Trapdoor DDH groups from pairings and isogeniesIndividual discrete logarithm with sublattice reductionA General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve AlgorithmLattice enumeration for tower NFS: a 521-bit discrete logarithm computationHigher-dimensional sieving for the number field sieve algorithmsLattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computationSolving discrete logarithms on a 170-bit MNT curve by pairing reductionThe special case of cyclotomic fields in quantum algorithms for unit groupsCollecting relations for the number field sieve inFaster individual discrete logarithms in finite fields of composite extension degreeComputing discrete logarithms in \(\mathbb F_{p^6}\)Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension DegreeComputing Generator in Cyclotomic Integer RingsUpdating key size estimations for pairingsThe Function Field Sieve in the Medium Prime CaseIndiscreet logarithms in finite fields of small characteristicLattice sieving in three dimensions for discrete log in medium characteristicSubexponential time relations in the class group of large degree number fieldsECM on Graphics CardsRefined analysis to the extended tower number field sieveSome mathematical remarks on the polynomial selection in NFSExtended Tower Number Field Sieve: A New Complexity for the Medium Prime CaseAn experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fieldsA Brief History of PairingsTraps to the BGJT-algorithm for discrete logarithmsThe multiple number field sieve for medium- and high-characteristic finite fieldsSubexponential class group and unit group computation in large degree number fields