Faster individual discrete logarithms in finite fields of composite extension degree
From MaRDI portal
Publication:4612570
DOI10.1090/MCOM/3376zbMath1457.11170arXiv1809.06135OpenAlexW2804627268MaRDI QIDQ4612570
Publication date: 31 January 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.06135
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (6)
Individual discrete logarithm with sublattice reduction ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Lattice sieving in three dimensions for discrete log in medium characteristic ⋮ Faster initial splitting for small characteristic composite extension degree fields ⋮ Refined analysis to the extended tower number field sieve
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Factoring polynomials with rational coefficients
- Computation of discrete logarithms in prime fields
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- 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
- The Tower Number Field Sieve
- Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
- Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
- New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Breaking ‘128-bit Secure’ Supersingular Binary Curves
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- Computing Discrete Logarithms in $${\mathbb F}_{3^{6 \cdot 137}}$$ and $${\mathbb F}_{3^{6 \cdot 163}}$$ Using Magma
- A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
- A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
- Computing Logarithms in Finite Fields of Characteristic Two
- A Hyperelliptic Smoothness Test, II
- New directions in cryptography
- A hyperelliptic smoothness test. I
- Discrete logarithms and local units
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Advances in Cryptology – CRYPTO 2004
- Practical Cryptography in High Dimensional Tori
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- Computation of a 768-Bit Prime Field Discrete Logarithm
- A Kilobit Hidden SNFS Discrete Logarithm Computation
- Weakness of $\mathbb{F}_{3^{6 \cdot 509}}$ for Discrete Logarithm Cryptography
- The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
- The Number Field Sieve in the Medium Prime Case
- Public Key Cryptography - PKC 2006
This page was built for publication: Faster individual discrete logarithms in finite fields of composite extension degree
