High Quality Content by WIKIPEDIA articles! Schnorr groups are useful in discrete log based cryptosystems including Schnorr signatures and DSA. In such applications, typically p is chosen to be large enough to resist index-calculus and related methods of solving the discrete-log problem, while q is large enough to resist the birthday attack on discrete log problems, which works in any group. 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; x is a member of the group if 0 < x < p and x^q equiv 1quad(hbox{mod}quad p).

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.