An experiment of number field sieve for discrete logarithm problem over GF(p^12)

DOI10.1007/978-3-642-42001-6_8MaRDI QIDQ2867252zbMATH OpenOpenAlexFDO

Authors K. Hayasaka, Kazumaro Aoki, Tetsutaro Kobayashi, Tsuyoshi Takagi

Publication date 10 December 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-42001-6_8

zbMATH Keywords

discrete logarithm problemextension fieldlattice sievenumber field sievepairing

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• The Number Field Sieve in the Medium Prime Case

Cited in

(6)

• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
• An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)
• On the use of the lattice sieve in the 3D NFS
• Solving a 676-bit discrete logarithm problem in \(\text{GF}(3^{6n})\)
• Higher-dimensional sieving for the number field sieve algorithms

This page was built for publication: An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^{12})\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867252)