2
$\begingroup$

I'm reading the paper “Collision-Resistant Hashing? Towards Making UOWHFs Practical” which states:

With an ACR hash function $F$ the key $K$ is announced and the adversary wins if she manages to any collision $M,M'$ for $f = F_K$. The points $M$ and $M'$ may depend arbitrarily on $K$.

Could you give me an example of messages $M$ and $M'$, so that they depend arbitrarily on $K$?

My other questions related to the same paper:
Dependence on Keyed Hash FunctionNo Birthday Attack to TCRWeaker Notion of Target Collision Resistance

$\endgroup$
2
$\begingroup$

Say $F_K(x)$ = $M \bmod K$.

Then after $K$ is announced choose arbitrary $M$ and compute $M' = M + K$.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.