On the Signature Calculus for finite fields of order square of prime numbers

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.

arXiv comment7 pages