New discrete logarithm computation for the medium prime case using the function field sieve
From MaRDI portal
Publication:2158232
Recommendations
- The Number Field Sieve in the Medium Prime Case
- The Function Field Sieve in the Medium Prime Case
- 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}}\)
- scientific article; zbMATH DE number 2086903
- scientific article; zbMATH DE number 799769
Cites work
- scientific article; zbMATH DE number 2086903 (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
- Algorithmic Cryptanalysis
- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
- 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}}\))
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Fast evaluation of logarithms in fields of characteristic two
- Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
- Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
- Function field sieve method for discrete logarithms over finite fields
- New directions in 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}}\)
- Selected areas in cryptography -- SAC 2013. 20th international conference, Burnaby, BC, Canada, August 14--16, 2013. Revised selected papers
- The Function Field Sieve in the Medium Prime Case
- Weakness of \(\mathbb{F}_{3^{6 \cdot 1429}}\) and \(\mathbb{F}_{2^{4 \cdot 3041}}\) for discrete logarithm cryptography
Cited in
(14)- Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
- scientific article; zbMATH DE number 2081061 (Why is no real title available?)
- Computation of a 768-bit prime field discrete logarithm
- 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}}\)
- Lattice sieving in three dimensions for discrete log in medium characteristic
- The multiple number field sieve for medium- and high-characteristic finite fields
- The Function Field Sieve in the Medium Prime Case
- Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
- Computation of a 30750-bit binary field discrete logarithm
- Cryptography and Coding
- Faster index calculus for the medium prime case application to 1175-bit and 1425-bit finite fields
- Faster individual discrete logarithms in finite fields of composite extension degree
- The Number Field Sieve in the Medium Prime Case
- Individual discrete logarithm with sublattice reduction
This page was built for publication: New discrete logarithm computation for the medium prime case using the function field sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158232)
