An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p 12)

DOI10.1007/978-3-642-42001-6_8zbMath1320.94067OpenAlexW2059038399MaRDI QIDQ2867252

Tetsutaro Kobayashi, Kenichiro Hayasaka, Tsuyoshi Takagi, Kazumaro Aoki

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 problempairingnumber field sieveextension fieldlattice sieve

Mathematics Subject Classification ID

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

Related Items (2)

Higher-dimensional sieving for the number field sieve algorithms ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\)

This page was built for publication: An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p 12)