On Computing Logarithms Over Finite Fields
From MaRDI portal
Recommendations
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- scientific article; zbMATH DE number 3918261
- Using number fields to compute logarithms in finite fields
- Computation of discrete logarithms in an arbitrary finite field
Cited in
(13)- On computing logarithms over GF(2**p)
- Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Optimal Randomness Extraction from a Diffie-Hellman Element
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- scientific article; zbMATH DE number 1024052 (Why is no real title available?)
- Using number fields to compute logarithms in finite fields
- scientific article; zbMATH DE number 7310271 (Why is no real title available?)
- Backtracking-assisted multiplication
- Fast elliptic curve scalar multiplications in SN(T)ARK circuits
- Efficiently-thresholdizable batched identity based encryption, with applications
- On the complexity of computing the logarithm and square root functions on a complex domain
This page was built for publication: On Computing Logarithms Over Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3719828)