arXiv · math/0502214
Complexity of Computing Quadratic Nonresidues
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
N. A. Carella. 2005-08-25. Complexity of Computing Quadratic Nonresidues. https://arxiv.org/abs/math/0502214
Cite the original work for its findings. Save a collection to share your selection of sources.