KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesTesting Quadratic Residuosity: Prime ModulusEngineering · Engineering MathematicsLesson 643/887← PrevNext →
GuidePublished 7 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AITesting Quadratic Residuosity: Prime Modulus

KEVOS knowledge first · trusted web sources when needed

Engineering  /  Mathematics  — Quadratic Residues

Testing Quadratic Residuosity: Prime Modulus

Deciding quadratic residuosity modulo a prime, and why the problem is easy in this case.

Page KV-MATH-0413Reading time 3 minReviewed 2026-08-07Author Kevin Jogin

Executive summary

Modulo a prime, quadratic residuosity is decided in polynomial time by Euler's criterion or, faster, by the Legendre symbol algorithm.

The problem is easy precisely because the modulus has no hidden structure, which is what changes when the modulus is composite.

Learning objectives

  1. State the decision procedure for a prime modulus.
  2. Compare the available methods.
  3. Explain why primality makes the problem tractable.

01The decision procedure

Two methods decide the question, and both are polynomial time.

Algorithm

Decide residuosity mod a prime

Inputprime p, integer a
Outputresidue or non-residue
  1. Given odd prime p and integer a with p not dividing a.
  2. Compute the Legendre symbol (a|p) by the Euclid-style algorithm.
  3. Return residue if the symbol is 1, non-residue if −1.
Cost  O(len(p)²) bit operations

The alternative, Euler's criterion, computes a^{(p−1)/2} mod p and reads off the result. It is a cubic-time method giving the same answer, and it is preferred only where fixed control flow matters.

02Why primality makes it easy

Modulo a prime, the units form a cyclic group and the residues are exactly the even powers of a generator — a subgroup of index 2. The quotient by that subgroup is the two-element group, and the quotient map is the Legendre symbol, which is efficiently computable.

  • Prime modulus

    One subgroup of index 2, and the quotient map is computable. Residuosity is decided directly.

  • Composite modulus

    Several subgroups of index 2. The Jacobi symbol computes one quotient; the residues are a strictly smaller set, and identifying them requires the factorisation.

Note
The asymmetry is entirely about how many index-2 subgroups exist. Modulo a prime there is exactly one, so the computable character determines residuosity. Modulo pq there are three, and the Jacobi symbol sees only one of them.

03Consequences

Prime versus composite
TaskPrime modulusComposite modulus
Decide residuosityPolynomial timeBelieved hard without the factorisation
Compute a square rootPolynomial time (randomised)Equivalent to factoring
Count square rootsExactly 24 for pq; 2^k in general

Every row changes in the same direction, and the reason is the same in each case: the composite modulus hides a decomposition that the prime modulus does not have. Knowing the decomposition restores all three to the easy column.

This is the structural fact that Goldwasser–Micali encryption and several related constructions are built on.

04Frequently asked questions

Is there any advantage to Euler's criterion here?

Constant-time behaviour. The Legendre algorithm branches on the operand values, so where the argument is secret the fixed exponentiation ladder is preferable despite being slower.

Does deciding residuosity give the square root?

No. The Legendre symbol answers yes or no without producing a witness. Extracting the root is a separate computation, and for p ≡ 1 (mod 4) it requires a randomised algorithm.

What about prime power moduli?

Residuosity modulo p^e for odd p reduces to residuosity modulo p, because the unit group is cyclic in both cases. The root is then lifted by Hensel's method.

Related pages

  • The Legendre Symbol
  • Computing the Jacobi Symbol
  • Testing Quadratic Residuosity: Prime Power and Composite Modulus

Sources and method

Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 291.

This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.

Author: Kevin Jogin. Last reviewed 2026-08-07.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Testing Quadratic Residuosity: Prime Modulus. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Testing Quadratic Residuosity: Prime Modulus as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—prime, residuosity, modulus, quadratic, easy—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

  • Can every symbol be traced to a definition or prior result?
  • Which hypothesis does each major step use?
  • Does the method cover zero, identity, degenerate and boundary cases?
  • Can the conclusion be checked by a second representation or calculation?
  • Are mandatory requirements distinguished from recommendations and illustrative values?
  • Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
  • Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
  • Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Testing Quadratic Residuosity: Prime Modulus?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which assumption about prime would change the result most if it proved false?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What evidence would allow an independent reviewer to reproduce or challenge the conclusion?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Which boundary, exception or failure case has not yet been tested?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

What must be handed over, monitored or reviewed after the immediate work is complete?

Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.

Authoritative references and use notes

The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.

  • MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.
  • MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.

Continue learning

Computing the Jacobi SymbolGuide · Engineering MathematicsNEXT LESSON →Testing Quadratic Residuosity: Prime Power and Composite ModulusGuide · Engineering MathematicsThe Jacobi SymbolGuide · Engineering MathematicsComputing Modular Square Roots: Prime ModulusGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®