On the signature calculus for finite fields of order square of prime numbers
From MaRDI portal
Publication:2436760
Abstract: In [Huang-Raskind 2009], the authors proved that the discrete logarithm problem in a prime finite field is random polynomial time equivalent to computing the ramification signature of a real quadratic field. In this paper, we do this for a quadratic extension of a prime field.
Recommendations
Cites work
- scientific article; zbMATH DE number 3674235 (Why is no real title available?)
- scientific article; zbMATH DE number 799769 (Why is no real title available?)
- Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- Discrete logarithms and local units
- Function field sieve method for discrete logarithms over finite fields
- Global duality, signature calculus and the discrete logarithm problem
- Reducing elliptic curve logarithms to logarithms in a finite field
- Using number fields to compute logarithms in finite fields
Cited in
(2)
This page was built for publication: On the signature calculus for finite fields of order square of prime numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436760)