This paper presents results that show that there exist
problems in that are provably hard in the generic group model but
easy to solve whenever the random encoding function is replaced
with a specific encoding function (or one drawn from a specific
set of encoding functions). We also show that there exist
cryptographic schemes that are provably hard in the generic group
model but easy to break in practice