Complexity of Computing Quadratic Nonresidues

Simple item page
dc.creatorCarella, N. A.
dc.date2005-02-10
dc.date2005-08-25
dc.date.accessioned2026-07-07T05:16:52Z
dc.date.available2026-07-07T05:16:52Z
dc.descriptionThis 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.
dc.descriptionReferences and Improvements
dc.identifierhttps://arxiv.org/abs/math/0502214
dc.identifierhttp://arxiv.org/abs/math/0502214
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74149
dc.subjectNumber Theory
dc.subjectPrimary 11Y16
dc.titleComplexity of Computing Quadratic Nonresidues
dc.typetext

Files

Collections

arXiv