Complexity of Computing Quadratic Nonresidues
Number Theory
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.math/0502214,
title = {Complexity of Computing Quadratic Nonresidues},
author = {N. A. Carella},
journal= {arXiv preprint arXiv:math/0502214},
year = {2007}
}
Comments
References and Improvements