I am trying to find a collision between two messages that will lead to the same CRC hash. Considering I am using CRC32, is there any way I can shorten the list of possible m
I believe CRC's are linear, so if you modify (in-place, without changing the length) two different parts of your file, the differences in the CRC should be xor'ed together.
-- correction: it does not seem to be quite that simple. However, this is still the kind of tack I would take in trying to construct a collision -- you need to follow the math in more detail than I am inclined to do tonight...