Complexity of Computing Quadratic Nonresidues

Details Complexity of Computing Quadratic Nonresidues Complexity of Computing Quadratic Nonresidues

2005-02-10

arxiv.org/abs/math/0502214v2

Mathematics

Number Theory

References and Improvements

Scientific paper

This note provides new methods for constructing quadratic nonresidues in
finite fields of characteristic p. It will be shown that there is an effective
deterministic polynomial time algorithm for constructing quadratic nonresidues
in finite fields.

Affiliated with

Also associated with

No associations

Rating

Complexity of Computing Quadratic Nonresidues 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 Complexity of Computing Quadratic Nonresidues, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Computing Quadratic Nonresidues will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-547068