Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm

DOI10.1007/978-3-662-48797-6_7zbMath1396.11141arXiv1505.07553OpenAlexW1950331499MaRDI QIDQ2811129

Aurore Guillevic

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.07553

zbMATH Keywords

finite fielddiscrete logarithmnumber field sieveindividual logarithm

Mathematics Subject Classification ID

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

Related Items (9)

Individual discrete logarithm with sublattice reduction ⋮ Higher-dimensional sieving for the number field sieve algorithms ⋮ 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}\) ⋮ Lattice sieving in three dimensions for discrete log in medium characteristic ⋮ Faster initial splitting for small characteristic composite extension degree fields ⋮ Refined analysis to the extended tower number field sieve

This page was built for publication: Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm