Higher Residuosity Problem

In cryptography, most public key cryptosystems are founded on problems that are believed to be intractable. The higher residuosity problem (also called the n th-residuosity problem) is one such problem. This problem is ''easier'' to solve than integer factorization, so the assumption that this problem is hard to solve is ''stronger'' than the assumption that integer factorization is hard.

Mathematical background

If ''n'' is an integer, then the integers modulo ''n'' form a ring. If ''n''=''pq'' where ''p'' and ''q'' are primes, then the Chinese remainder theorem tells us that

:$\mathbb/n\mathbb \simeq \mathbb/p\mathbb \times \mathbb/q\mathbb$

The group of units of any ring form a group, and the group of units in $\mathbb/n\mathbb$ is traditionally denoted $(\mathbb/n\mathbb) ^*$.

From the isomorphism above, we have

:$(\mathbb/n\mathbb)^* \simeq (\mathbb/p\mathbb)^* \times (\mathbb/q\mathbb)^*$

as an isomorphism of ''groups''. Since ''p'' and ''q'' were assumed to be prime, the groups $(\mathbb/p\mathbb)^*$ and $(\mathbb/q\mathbb)^*$ are cyclic of orders ''p''-1 and ''q''-1 respectively. If ''d'' is a divisor of ''p''-1, then the set of ''d''th powers in $(\mathbb/p\mathbb)^*$ form a subgroup of index ''d''. If gcd(''d'',''q''-1) = 1, then ''every'' element in $(\mathbb/q\mathbb)^*$ is a ''d''th power, so the set of ''d''th powers in $(\mathbb/n\mathbb)^*$ is also a subgroup of index ''d''. In general, if gcd(''d'',''q''-1) = ''g'', then there are (''q''-1)/(''g'') ''d''th powers in $(\mathbb/q\mathbb)^*$, so the set of ''d''th powers in $(\mathbb/n\mathbb)^*$ has index ''dg''.
This is most commonly seen when ''d''=2, and we are considering the subgroup of quadratic residues, it is well known that exactly one quarter of the elements in $(\mathbb/n\mathbb)^*$ are
quadratic residues (when ''n'' is the product of exactly two primes, as it is here).

The important point is that for any divisor ''d'' of ''p''-1 (or ''q''-1) the set of ''d''th powers forms a subgroup of $(\mathbb/n\mathbb)^*.$

Problem statement

Given an integer ''n'' = ''pq'' where ''p'' and ''q'' are unknown, an integer ''d'' such that ''d'' divides ''p''-1, and an integer ''x'' < ''n'', it is infeasible to determine whether ''x'' is a ''d''th power (equivalently ''d''th residue) modulo ''n''.

Notice that if ''p'' and ''q'' are known it is easy to determine whether ''x'' is a ''d''th residue modulo ''n'' because ''x'' will be a ''d''th residue modulo ''p'' if and only if

:$x^ \equiv 1 \pmod p$

When ''d''=2, this is called the quadratic residuosity problem.

Applications

The semantic security of the Benaloh cryptosystem and the Naccache–Stern cryptosystem rests on the intractability of this problem.

References

{{DEFAULTSORT:Higher Residuosity Problem
Computational number theory
Computational hardness assumptions