Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
From MaRDI portal
Publication:2948326
DOI10.1007/978-3-662-46800-5_6zbMath1365.94399OpenAlexW600997534MaRDI QIDQ2948326
Razvan Barbulescu, François Morain, Pierrick Gaudry, Aurore Guillevic
Publication date: 30 September 2015
Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01112879v2/file/BGGM-Eurocrypt15.pdf
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (20)
A classification of ECM-friendly families of elliptic curves using modular 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 ⋮ 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 ⋮ 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 ⋮ Lattice sieving in three dimensions for discrete log in medium characteristic ⋮ 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: Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
