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)?
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)?
Dear Sir, i face the same problem ...plz if u got the answer reply to this forum as soon as possible...thx