Traps to the BGJT-algorithm for discrete logarithms

DOI10.1112/S1461157014000242zbMath1369.11101arXiv1310.5124OpenAlexW3103468534MaRDI QIDQ2878837

Qi Cheng, Daqing Wan, Jincheng Zhuang

Publication date: 5 September 2014

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

non-Kummer casesquasi-polynomial time algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Classifying and generating exact coset representatives of \(\operatorname{PGL}_2(\mathbb{F}_q)\) in \(\operatorname{PGL}_2(\mathbb{F}_{q^2})\) ⋮ Factor base discrete logarithms in Kummer extensions ⋮ On the discrete logarithm problem in finite fields of fixed characteristic

Cites Work

• On the Function Field Sieve and the Impact of Higher Splitting Probabilities
• Fast evaluation of logarithms in fields of characteristic two
• The Function Field Sieve in the Medium Prime Case
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Generators and irreducible polynomials over finite fields
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• The Number Field Sieve in the Medium Prime Case

This page was built for publication: Traps to the BGJT-algorithm for discrete logarithms