arXiv · 1103.1019
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.
Explore related subjects
Keep this discovery
Qizhi Zhang. 2012-04-08. On the Signature Calculus for finite fields of order square of prime numbers. https://arxiv.org/abs/1103.1019
Cite the original work for its findings. Save a collection to share your selection of sources.