Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

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

share|improve this question

1 Answer 1

up vote 2 down vote accepted

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

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

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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