scientific article; zbMATH DE number 2086903
From MaRDI portal
Publication:4737504
Recommendations
Cited in
(21)- Indiscreet logarithms in finite fields of small characteristic
- Function field sieve method for discrete logarithms over finite fields
- Updating key size estimations for pairings
- New discrete logarithm computation for the medium prime case using the function field sieve
- Faster initial splitting for small characteristic composite extension degree fields
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
- 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 multiple number field sieve for medium- and high-characteristic finite fields
- A general polynomial selection method and new asymptotic complexities for the tower number field sieve algorithm
- The Function Field Sieve in the Medium Prime Case
- scientific article; zbMATH DE number 5532108 (Why is no real title available?)
- Faster individual discrete logarithms in finite fields of composite extension degree
- The Special Function Field Sieve
- scientific article; zbMATH DE number 1408416 (Why is no real title available?)
- Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
- Algorithmic Number Theory
- Selecting polynomials for the function field sieve
- Algebraic curves and cryptography
- A comparison of MNT curves and supersingular 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737504)
