Factor base discrete logarithms in Kummer extensions

DOI10.1016/J.FFA.2018.06.008MaRDI QIDQ1654504zbMATH OpenOpenAlexFDO

Authors Dianyan Xiao, Jincheng Zhuang, Qi Cheng

Publication date 8 August 2018

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ffa.2018.06.008

zbMATH Keywords

finite fieldscharacter sumdiscrete logarithmsKummer extension

Mathematics Subject Classification ID

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

Recommendations

• On the discrete logarithm problem in finite fields of fixed characteristic
• Computation of discrete logarithms in an arbitrary finite field
• The index calculus method using non-smooth polynomials
• Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>

Cites work

• scientific article; zbMATH DE number 1594292 (Why is no real title available?)
• scientific article; zbMATH DE number 1210375 (Why is no real title available?)
• scientific article; zbMATH DE number 1254302 (Why is no real title available?)
• scientific article; zbMATH DE number 2081061 (Why is no real title available?)
• scientific article; zbMATH DE number 799769 (Why is no real title available?)
• scientific article; zbMATH DE number 3214560 (Why is no real title available?)
• A brief history of pairings
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
• A taxonomy of pairing-friendly elliptic curves
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Constructing high order elements through subspace polynomials
• Diameters and Eigenvalues
• Elements of high order on finite fields from elliptic curves
• Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
• Finding primitive elements in finite fields of small characteristic
• Generators and irreducible polynomials over finite fields
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• Matrix multiplication via arithmetic progressions
• On the discrete logarithm problem in finite fields of fixed characteristic
• On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
• On the multiplicative order of elements in Wiedemann's towers of finite fields
• Primitive Polynomials Over Finite Fields
• Searching for Primitive Roots in Finite Fields
• Traps to the BGJT-algorithm for discrete logarithms

Cited in

(4)

• Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
• A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
• Traps to the BGJT-algorithm for discrete logarithms
• On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields

This page was built for publication: Factor base discrete logarithms in Kummer extensions

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