Faster initial splitting for small characteristic composite extension degree fields
From MaRDI portal
Publication:2302583
DOI10.1016/j.ffa.2019.101629zbMath1457.11171OpenAlexW3000631028WikidataQ126345934 ScholiaQ126345934MaRDI QIDQ2302583
Palash Sarkar, Madhurima Mukhopadhyay
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Selected areas in cryptography -- SAC 2013. 20th international conference, Burnaby, BC, Canada, August 14--16, 2013. Revised selected papers
- Function field sieve method for discrete logarithms over finite fields
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
- Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
- On the Function Field Sieve and the Impact of Higher Splitting Probabilities
- Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- Fast evaluation of logarithms in fields of characteristic two
- Computing Logarithms in Finite Fields of Characteristic Two
- Faster individual discrete logarithms in finite fields of composite extension degree
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
This page was built for publication: Faster initial splitting for small characteristic composite extension degree fields
