A subexponential algorithm for discrete logarithms over all finite fields
From MaRDI portal
Recommendations
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- On Computing Logarithms Over Finite Fields
Cited in
(17)- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- A probabilistic analysis on a lattice attack against DSA
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
- Speeding up exponentiation using an untrusted computational resource
- Subexponential time relations in the class group of large degree number fields
- A research on new public-key encryption schemes
- Effective compression maps for torus-based cryptography
- (EC)DSA lattice attacks based on Coppersmith's method
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- The Function Field Sieve in the Medium Prime Case
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)
- Parameterized Splitting Systems for the Discrete Logarithm
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- The generalized Weil pairing and the discrete logarithm problem on elliptic curves
- A shorter proof for an explicit formula for discrete logarithms in finite fields
This page was built for publication: A subexponential algorithm for discrete logarithms over all finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341740)
