Quadratic Residuosity Problem

The quadratic residuosity problem (QRP) in computational number theory is to decide, given integers $a$ and $N$, whether $a$ is a quadratic residue modulo $N$ or not.
Here $N = p_1 p_2$ for two unknown primes $p_1$ and $p_2$, and $a$ is among the numbers which are not obviously quadratic non-residues (see below).

The problem was first described by Gauss in his '' Disquisitiones Arithmeticae'' in 1801.
This problem is believed to be computationally difficult.
Several cryptographic methods rely on its hardness, see .

An efficient algorithm for the quadratic residuosity problem immediately implies efficient algorithms for other number theoretic problems, such as deciding whether a composite $N$ of unknown factorization is the product of 2 or 3 primes.

Precise formulation

Given integers $a$ and $T$, $a$ is said to be a ''quadratic residue modulo $T$'' if there exists an integer $b$ such that

:$a \equiv b^2 \pmod T$.

Otherwise we say it is a quadratic non-residue.
When $T = p$ is a prime, it is customary to use the Legendre symbol:

:$\left(\frac\right) = \begin 1 & \text a \text p \text a \not\equiv 0\pmod, \\ -1 & \text a \text p, \\ 0 & \text a \equiv 0 \pmod. \end$

This is a multiplicative character which means $\big(\tfrac\big) = 1$ for exactly $(p-1)/2$ of the values $1,\ldots,p-1$, and it is $-1$ for the remaining.

It is easy to compute using the law of quadratic reciprocity in a manner akin to the Euclidean algorithm, see Legendre symbol.

Consider now some given $N = p_1 p_2$ where $p_1$ and $p_2$ are two, different unknown primes.
A given $a$ is a quadratic residue modulo $N$ if and only if $a$ is a quadratic residue modulo both $p_1$ and $p_2$ and $gcd(a, N) = 1$.

Since we don't know $p_1$ or $p_2$, we cannot compute $\big(\tfrac\big)$ and $\big(\tfrac\big)$. However, it is easy to compute their product.
This is known as the Jacobi symbol:

:$\left(\frac\right) = \left(\frac\right)\left(\frac\right)$

This can also be efficiently computed using the law of quadratic reciprocity for Jacobi symbols.

However, $\big(\tfrac\big)$ can not in all cases tell us whether $a$ is a quadratic residue modulo $N$ or not!
More precisely, if $\big(\tfrac\big) = -1$ then $a$ is necessarily a quadratic non-residue modulo either $p_1$ or $p_2$, in which case we are done.
But if $\big(\tfrac\big) = 1$ then it is either the case that $a$ is a quadratic residue modulo both $p_1$ and $p_2$, or a quadratic non-residue modulo both $p_1$ and $p_2$.
We cannot distinguish these cases from knowing just that $\big(\tfrac\big) = 1$.

This leads to the precise formulation of the quadratic residue problem:

Problem:
Given integers $a$ and $N = p_1 p_2$, where $p_1$ and $p_2$ are unknown, different primes, and where $\big(\tfrac\big) = 1$, determine whether $a$ is a quadratic residue modulo $N$ or not.

Distribution of residues

If $a$ is drawn uniformly at random from integers $0,\ldots,N-1$ such that $\big(\tfrac\big) = 1$, is $a$ more often a quadratic residue or a quadratic non-residue modulo $N$?

As mentioned earlier, for exactly half of the choices of $a \in \$, then $\big(\tfrac\big) = 1$, and for the rest we have $\big(\tfrac\big) = -1$.
By extension, this also holds for half the choices of $a \in \ \setminus p_1\mathbb$.
Similarly for $p_2$.
From basic algebra, it follows that this partitions $(\mathbb/N\mathbb)^\times$ into 4 parts of equal size, depending on the sign of $\big(\tfrac\big)$ and $\big(\tfrac\big)$.

The allowed $a$ in the quadratic residue problem given as above constitute exactly those two parts corresponding to the cases $\big(\tfrac\big) = \big(\tfrac\big) = 1$ and $\big(\tfrac\big) = \big(\tfrac\big) = -1$.
Consequently, exactly half of the possible $a$ are quadratic residues and the remaining are not.

Applications

The intractability of the quadratic residuosity problem is the basis for the security of the Blum Blum Shub pseudorandom number generator. It also yields the public key Goldwasser–Micali cryptosystem. as well as the identity based Cocks scheme.

See also

* Higher residuosity problem

References

{{Computational hardness assumptions

Computational number theory
Computational hardness assumptions
Theory of cryptography