Currently, the algorithm search for collision at any location, taking only the number of bytes that must be equal. Those bytes can be in any location in the digest.
As most of the papers that use partial collision to create an attack to the hash function searches a block in the beginning of the hash, we will update our algorithm.
Currently, the algorithm search for collision at any location, taking only the number of bytes that must be equal. Those bytes can be in any location in the digest. As most of the papers that use partial collision to create an attack to the hash function searches a block in the beginning of the hash, we will update our algorithm.