let M=m1m2m3....mj ; let h1=m1 and h(i) = RSA[h(i-1)] xor mi where RSA[x] = x^e mod n;

The hash of the message M is H(M)=h(j).

How can I find another message N such that H(N)=H(M)?

Printable View

- April 25th 2012, 10:36 AMbillobillohash functions
let M=m1m2m3....mj ; let h1=m1 and h(i) = RSA[h(i-1)] xor mi where RSA[x] = x^e mod n;

The hash of the message M is H(M)=h(j).

How can I find another message N such that H(N)=H(M)? - April 25th 2012, 11:42 AMjaberamziRe: hash functions