## Schnorr group## From CryptoDox, The Online Encyclopedia on Cryptography and Information SecurityA Schnorr groups are useful in discrete log based cryptosystems including Schnorr signatures and DSA. In such applications, typically <math>p\,</math> is chosen to be large enough to resist index-calculus and related methods of solving the discrete-log problem (perhaps 1024-2048 bits), while <math>q\,</math> is large enough to resist the birthday attack on discrete log problems, which works in any group (perhaps 160-512 bits). Because the Schnorr group is of prime order, it has no non-trivial subgroups, thwarting small subgroup attacks. 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; <math>x\,</math> is a member of the group if <math>0 < x < p\,</math> and <math>x^q = 1\quad(\hbox{mod}\quad p)\,</math>. It will usually also be appropriate to reject <math>x = 1\,</math>. Schnorr groups were proposed for cryptographic use by Claus-Peter Schnorr. |