Complexity of Computing Quadratic Nonresidues

N.A. Carella

Complexity of Computing Quadratic Nonresidues

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0502214 v2 pith:WARYBJR3 submitted 2005-02-10 math.NT

N.A. Carella This is my paper · ORCID

classification math.NT

keywords nonresiduesquadraticconstructingfieldsfinitealgorithmcharacteristiccomplexity

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

PPT: New Low Complexity Deterministic Primality Tests Leveraging Explicit and Implicit Non-Residues. A Set of Three Companion Manuscripts
cs.CR 2019-08 reject novelty 5.0 of 10

The authors conjecture that an odd non-square N is prime iff a quadratic non-residue q, with q not congruent to -1, passes both the Euler criterion and a quadratic-extension binomial congruence.

Pith tools