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

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

2011-03-05

arxiv.org/abs/1103.1019v3

Mathematics

Number Theory

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Signature Calculus for finite fields of order square of prime numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Signature Calculus for finite fields of order square of prime numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Signature Calculus for finite fields of order square of prime numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8711