Study of the discrete logarithm problem in F_p^ 3
From MaRDI portal
Publication:1903546
Recommendations
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- On Computing Logarithms Over Finite Fields
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- Computation of discrete logarithms in an arbitrary finite field
- scientific article; zbMATH DE number 3863322
Cites work
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 3233757 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
- A classical invitation of algebraic numbers and class fields. With two appendices by Olga Taussky: ``Artin's 1932 Göttingen lectures on class field theory and ``Connections between algebraic number theory and integral matrices.
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- Fast Computation of Discrete Logarithms in GF (q)
- The Euclidean Condition in Pure Cubic and Complex Quartic Fields
Cited in
(6)- What is the inverse of repeated square and multiply algorithm?
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Discrete Restriction for (x,x3) and Related Topics
- Lifting of solutions of an exponential congruence
- Factor base discrete logarithms in Kummer extensions
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
This page was built for publication: Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903546)