Faster initial splitting for small characteristic composite extension degree fields

DOI10.1016/J.FFA.2019.101629MaRDI QIDQ2302583zbMATH OpenOpenAlexWikidataFDO

Authors Madhurima Mukhopadhyay, Palash Sarkar

Publication date 26 February 2020

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

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

zbMATH Keywords

cryptographyfinite fieldsdiscrete logfunction field sieve

Mathematics Subject Classification ID

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

Recommendations

• Faster individual discrete logarithms in finite fields of composite extension degree
• scientific article; zbMATH DE number 2086903
• Selecting polynomials for the function field sieve
• 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}}\)
• The Special Function Field Sieve

Cites work

• scientific article; zbMATH DE number 1186945 (Why is no real title available?)
• scientific article; zbMATH DE number 799769 (Why is no real title available?)
• 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
• Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
• Computing Logarithms in Finite Fields of Characteristic Two
• Computing discrete logarithms in \(\mathbb F_{3^{6 \cdot 137}}\) and \(\mathbb F_{3^{6 \cdot 163}}\) using Magma
• Computing individual discrete logarithms faster in \(\mathrm{GF}(p^n)\) with the NFS-DL algorithm
• Fast evaluation of logarithms in fields of characteristic two
• Faster individual discrete logarithms in finite fields of composite extension degree
• Function field sieve method for discrete logarithms over finite fields
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• 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}}\)
• Selected areas in cryptography -- SAC 2013. 20th international conference, Burnaby, BC, Canada, August 14--16, 2013. Revised selected papers
• Solving a $$6120$$ -bit DLP on a Desktop Computer
• The complete analysis of a polynomial factorization algorithm over finite fields
• Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
• Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography

Cited in

(2)

• Faster individual discrete logarithms in finite fields of composite extension degree
• Individual discrete logarithm with sublattice reduction

This page was built for publication: Faster initial splitting for small characteristic composite extension degree fields

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