A Schnorr group, proposed by Claus P. Schnorr, is a large prime-order subgroup of ${\displaystyle \mathbb {Z} _{p}^{\times }}$, the multiplicative group of integers modulo ${\displaystyle p}$ for some prime ${\displaystyle p}$. To generate such a group, generate ${\displaystyle p}$, ${\displaystyle q}$, ${\displaystyle r}$ such that

${\displaystyle p=qr+1}$

with ${\displaystyle p}$, ${\displaystyle q}$ prime. Then choose any ${\displaystyle h}$ in the range ${\displaystyle 1<h<p}$ until you find one such that

${\displaystyle h^{r}\not \equiv 1\;({\text{mod}}\;p)}$.

This value

${\displaystyle g=h^{r}{\text{ mod }}p}$

is a generator of a subgroup of ${\displaystyle \mathbb {Z} _{p}^{\times }}$ of order ${\displaystyle q}$.

Schnorr groups are useful in discrete log based cryptosystems including Schnorr signatures and DSA. In such applications, typically ${\displaystyle p}$ is chosen to be large enough to resist index calculus and related methods of solving the discrete-log problem (perhaps 1024 to 3072 bits), while ${\displaystyle q}$ is large enough to resist the birthday attack on discrete log problems, which works in any group (perhaps 160 to 256 bits). Because the Schnorr group is of prime order, it has no non-trivial proper subgroups, thwarting confinement attacks due to small subgroups. Implementations of protocols that use Schnorr groups must verify where appropriate that integers supplied by other parties are in fact members of the Schnorr group; ${\displaystyle x}$ is a member of the group if ${\displaystyle 0<x<p}$ and ${\displaystyle x^{q}\equiv 1\;({\text{mod }}p)}$. Any member of the group except the element ${\displaystyle 1}$ is also a generator of the group.