Factor base discrete logarithms in Kummer extensions
From MaRDI portal
Publication:1654504
DOI10.1016/J.FFA.2018.06.008zbMATH Open1435.11143OpenAlexW2810640119MaRDI QIDQ1654504FDOQ1654504
Jincheng Zhuang, Dianyan Xiao, 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
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>
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- A taxonomy of pairing-friendly elliptic curves
- Title not available (Why is that?)
- On the Function Field Sieve and the Impact of Higher Splitting Probabilities
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- ELEMENTS OF HIGH ORDER ON FINITE FIELDS FROM ELLIPTIC CURVES
- Searching for Primitive Roots in Finite Fields
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Generators and irreducible polynomials over finite fields
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- Diameters and Eigenvalues
- Title not available (Why is that?)
- Traps to the BGJT-algorithm for discrete logarithms
- Finding primitive elements in finite fields of small characteristic
- Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
- Primitive Polynomials Over Finite Fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- On the discrete logarithm problem in finite fields of fixed characteristic
- On the multiplicative order of elements in Wiedemann's towers of finite fields
- Title not available (Why is that?)
- A Brief History of Pairings
Cited In (1)
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)