quadratic residuosity problem
E1438436
UNEXPLORED
The quadratic residuosity problem is a fundamental decision problem in number theory and cryptography that asks, given an integer and a modulus (typically a composite like a Blum integer), whether the integer is a quadratic residue modulo that modulus.
All labels observed (1)
| Label | Occurrences |
|---|---|
| quadratic residuosity problem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T20578250 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: quadratic residuosity problem Context triple: [Blum integer, relatedTo, quadratic residuosity problem]
-
A.
Rabin cryptosystem
The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
-
B.
quadratic reciprocity law
The quadratic reciprocity law is a fundamental theorem in number theory that characterizes when a quadratic equation modulo one odd prime has solutions in terms of solvability modulo another, revealing a deep symmetry between primes.
-
C.
short integer solution (SIS) problem
The short integer solution (SIS) problem is a fundamental lattice-based computational problem that underpins many modern cryptographic constructions, especially in post-quantum cryptography.
-
D.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
E.
RSA Design
RSA Design is a creative design division of the production company RSA Films, specializing in visual and graphic solutions for film, advertising, and branded content.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: quadratic residuosity problem Target entity description: The quadratic residuosity problem is a fundamental decision problem in number theory and cryptography that asks, given an integer and a modulus (typically a composite like a Blum integer), whether the integer is a quadratic residue modulo that modulus.
-
A.
Rabin cryptosystem
The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
-
B.
quadratic reciprocity law
The quadratic reciprocity law is a fundamental theorem in number theory that characterizes when a quadratic equation modulo one odd prime has solutions in terms of solvability modulo another, revealing a deep symmetry between primes.
-
C.
short integer solution (SIS) problem
The short integer solution (SIS) problem is a fundamental lattice-based computational problem that underpins many modern cryptographic constructions, especially in post-quantum cryptography.
-
D.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
E.
RSA Design
RSA Design is a creative design division of the production company RSA Films, specializing in visual and graphic solutions for film, advertising, and branded content.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.