Complexity of Computing Quadratic Nonresidues

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
References and Improvements

Keywords

Number Theory, Primary 11Y16

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/74149

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0502214
 http://arxiv.org/abs/math/0502214

Collections

arXiv