The Function Field Sieve in the Medium Prime Case
From MaRDI portal
Recommendations
- The Number Field Sieve in the Medium Prime Case
- New discrete logarithm computation for the medium prime case using 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}}\)
- Algorithmic Number Theory
- scientific article; zbMATH DE number 2086903
Cites work
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Number Theory
- Discrete logarithms and local units
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Fast evaluation of logarithms in fields of characteristic two
- Function field sieve method for discrete logarithms over finite fields
- scientific article; zbMATH DE number 1643939 (Why is no real title available?)
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- scientific article; zbMATH DE number 1186945 (Why is no real title available?)
- scientific article; zbMATH DE number 503245 (Why is no real title available?)
- scientific article; zbMATH DE number 1024052 (Why is no real title available?)
- scientific article; zbMATH DE number 1942430 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1504559 (Why is no real title available?)
- scientific article; zbMATH DE number 1759768 (Why is no real title available?)
- scientific article; zbMATH DE number 2086903 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 799769 (Why is no real title available?)
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Monte Carlo Methods for Index Computation (mod p)
- On the Discrete Logarithm Problem on Algebraic Tori
- Practical Cryptography in High Dimensional Tori
- Short signatures from the Weil pairing
- Solving sparse linear equations over finite fields
- The development of the number field sieve
- The Number Field Sieve in the Medium Prime Case
Cited in
(20)- Applications to cryptography of twisting commutative algebraic groups
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- Using abelian varieties to improve pairing-based cryptography
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
- Elliptic periods and primality proving
- Indiscreet logarithms in finite fields of small characteristic
- Updating key size estimations for pairings
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
- New discrete logarithm computation for the medium prime case using the function field sieve
- Refined analysis to the extended tower number field sieve
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- Traps to the BGJT-algorithm for discrete logarithms
- A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
- Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
- Algorithmic Number Theory
- Selecting polynomials for the function field sieve
- The Number Field Sieve in the Medium Prime Case
- On index calculus algorithms for subfield curves
- Index calculus in the trace zero variety
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
This page was built for publication: The Function Field Sieve in the Medium Prime Case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593100)
