On the signature calculus for finite fields of order square of prime numbers

In this paper it is proved that the discrete logarithm problem in a quadratic extension of a prime field is random polynomial time equivalent to computing the ramification signature of a real quadratic field. This extends a result in [4] from a prime field to its quadratic extensions.