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

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Blum integer relatedTo quadratic residuosity problem