generic algorithm for breaking a cryptographic hardness assumption". A generic algorithm is an algorithm that only makes use of the group operation, and does not consider the encoding of the group. This question was answered for the discrete logarithm problem by Victor Shoup using the generic group model. Other results in the generic group model are for instance . The model can also be extended to other algebraic structures like rings.

The generic group