Suppose we truncate only 40 bits of sha1 hash output.hence it is insecure.how can we find two message as input which gives first 40 bits of hash as same value i.e we have to find collision for first ...
In easy steps, this is how it works: Convert txt to numbers. mod 1-26. Generate random numbers (by my other cipher) equal to plain txt. Write random numbers under txt numbers. Like this: ...