Quadratic residuosity problem¶

The computational decision problem of determining whether a number with Jacobi symbol one is a square modulo a composite whose prime factorization is unknown.

Version: v1 · 2026-09-08 · History
Domain-specific #: 6302
Origin domain: computational number theory
Subdomain: cryptographic hardness problems

Core Idea¶

The quadratic residuosity problem asks whether a Jacobi-one input is a quadratic residue modulo a composite of hidden factorization.^[1] With factors, Legendre-symbol tests decide residuosity componentwise; without them, the Jacobi symbol filters obvious nonresidues but leaves a conjecturally hard distinction. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of computational number theory. It is factoring-linked hard decision between residues and pseudoresidue-looking nonresidues. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Quadratic residuosity problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

Structural Signature¶

Carrier: an odd composite modulus N, an integer a coprime to N, Jacobi symbol, unknown prime factorization, modular squares, a decision algorithm and complexity assumption
Inputs or antecedent state: the exact computational number theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Quadratic residuosity problem
Constitutive operation: With factors, Legendre-symbol tests decide residuosity componentwise; without them, the Jacobi symbol filters obvious nonresidues but leaves a conjecturally hard distinction.
Invariant: the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite
Recognition test: type the carrier, state every parameter and convention in the definition, test that the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
Output or consequence: recognizing and comparing instances of Quadratic residuosity problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
Failure boundary: the carrier is mistyped, the condition that the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not¶

It is not the whole field of computational number theory. The field contains many questions and methods that do not instantiate Quadratic residuosity problem.
It is not its most familiar example. For an RSA-like product of two unknown odd primes, decide whether a Jacobi-one value has a modular square root without first factoring the modulus. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
It is not the neighboring catalog concept Integer factorization problem. Knowing a factorization efficiently solves quadratic residuosity, but no general equivalence proving that every residuosity solver factors the modulus is known under all formulations.
It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Quadratic residuosity problem must control the decision
It is not an unrestricted metaphor for any process that seems similar. Outside computational number theory, the vocabulary and validity conditions do not transfer literally.

Scope of Application¶

Quadratic residuosity problem belongs to computational number theory and is useful where the analyst can specify an odd composite modulus N, an integer a coprime to N, Jacobi symbol, unknown prime factorization, modular squares, a decision algorithm and complexity assumption, then evaluate the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite. The scope is broad within that domain but bounded by the need for the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite. This entry records a public mathematical hardness problem and high-level cryptographic use, not instructions for attacking deployed systems.^[2]

Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
Construction or evolution. Track how the exact computational number theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Quadratic residuosity problem are converted, constrained, or organized by With factors, Legendre-symbol tests decide residuosity componentwise; without them, the Jacobi symbol filters obvious nonresidues but leaves a conjecturally hard distinction..
Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Quadratic residuosity problem must control the decision and state which convention or theorem controls the decision.
Downstream reasoning. Use the established identity to support recognizing and comparing instances of Quadratic residuosity problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Quadratic residuosity problem can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact computational number theory carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Quadratic residuosity problem, the structure counts as Quadratic residuosity problem exactly when the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Quadratic residuosity problem. Quadratic residuosity problem compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Quadratic residuosity problem. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: an odd composite modulus N, an integer a coprime to N, Jacobi symbol, unknown prime factorization, modular squares, a decision algorithm and complexity assumption. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
Derive consequences. From the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite, infer recognizing and comparing instances of Quadratic residuosity problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Quadratic residuosity problem must control the decision and an object that resembles Quadratic residuosity problem in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of computational number theory because they reuse an odd composite modulus N, an integer a coprime to N, Jacobi symbol, unknown prime factorization, modular squares, a decision algorithm and complexity assumption, With factors, Legendre-symbol tests decide residuosity componentwise; without them, the Jacobi symbol filters obvious nonresidues but leaves a conjecturally hard distinction., and type the carrier, state every parameter and convention in the definition, test that the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from For an RSA-like product of two unknown odd primes, decide whether a Jacobi-one value has a modular square root without first factoring the modulus. to A security proof states the modulus distribution and precise hardness assumption and does not conflate deciding residuosity with computing a square root..^[3]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Quadratic residuosity problem, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples¶

Canonical¶

For an RSA-like product of two unknown odd primes, decide whether a Jacobi-one value has a modular square root without first factoring the modulus. The example exposes the carrier and directly tests that the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is an odd composite modulus N, an integer a coprime to N, Jacobi symbol, unknown prime factorization, modular squares, a decision algorithm and complexity assumption; the operative rule is With factors, Legendre-symbol tests decide residuosity componentwise; without them, the Jacobi symbol filters obvious nonresidues but leaves a conjecturally hard distinction.; the invariant is the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite; and the result supports recognizing and comparing instances of Quadratic residuosity problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.^[1] Changing incidental notation or scale leaves the structure intact, while removing the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite destroys the classification.

Mapped back: an odd composite modulus N, an integer a coprime to N, Jacobi symbol, unknown prime factorization, modular squares, a decision algorithm and complexity assumption → With factors, Legendre-symbol tests decide residuosity componentwise; without them, the Jacobi symbol filters obvious nonresidues but leaves a conjecturally hard distinction. → the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite → recognizing and comparing instances of Quadratic residuosity problem, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice¶

A security proof states the modulus distribution and precise hardness assumption and does not conflate deciding residuosity with computing a square root. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the modulus class, coprimality and Jacobi-one promise are stated and the decision is square existence modulo the whole composite fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.^[2] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions¶

T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character¶

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Quadratic residuosity problem, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Quadratic residuosity problem, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from computational number theory and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent¶

The structural core consists of a carrier, With factors, Legendre-symbol tests decide residuosity componentwise; without them, the Jacobi symbol filters obvious nonresidues but leaves a conjecturally hard distinction., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Quadratic residuosity problem, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Quadratic residuosity problem, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in computational number theory.

The proposed strict upward parent is prime:classification. The problem classifies promised residues versus nonresidues under computational limits; modular arithmetic supplies the residual. This is a proposal-only workspace relationship: the accepted Prime supplies a genuinely instantiated structural prerequisite or superclass, while Quadratic residuosity problem adds domain-specific constraints.

The entry does not collapse into that parent because factoring-linked hard decision between residues and pseudoresidue-looking nonresidues It also declines a nearby thematic catalog node: the neighbor does not literally subsume the constitutive identity of Quadratic residuosity problem. This explicit assert-and-decline pattern keeps the proposed DAG narrow and prevents a merely thematic edge.

The prospective workspace queue contains one strict upward edge to prime:classification. No live DAG mutation is authorized.

Relationships to Other Abstractions¶

Current abstraction Quadratic residuosity problem Domain-specific

Parents (1) — more general patterns this builds on

Quadratic residuosity problem is a kind of Classification Prime

The proposed strict upward parent is prime:classification.

Hierarchy path (1) — routes to 1 parentless root

Quadratic residuosity problem → Classification

Neighborhood in Abstraction Space¶

Quadratic residuosity problem sits in a moderately populated region (46^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Algebraic Number Theory & Reciprocity (28 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With¶

Integer factorization problem. Knowing a factorization efficiently solves quadratic residuosity, but no general equivalence proving that every residuosity solver factors the modulus is known under all formulations.
One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
Measurement or implementation of Quadratic residuosity problem. A proxy or realization is evidence for the abstraction, not the abstraction itself.
Generalized Quadratic residuosity problem. An extension qualifies only when its changed axioms and retained invariant are stated.

References¶

[1] Burt Kaliski, 'Encyclopedia of Cryptography and Security', 2011, doi:10.1007/978-1-4419-5906-5_429. registry ↩a ↩b

[2] Adleman, L, 'On Distinguishing Prime Numbers from Composite Numbers', Proceedings of the 21^st IEEE Symposium on the Foundations of Computer Science (FOCS), Syracuse, N.Y, 1980, doi:10.1109/SFCS.1980.28. registry ↩a ↩b

[3] S. Goldwasser, S. Micali, 'Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82', 1982, doi:10.1145/800070.802212. registry ↩