CRC32 Collision

Question

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

Answer 1

Brute force you need about sqrt(6N) random length messages for a hash of size N to get a 95% probability for collision. E.g. CRC32 , N = 2^32 , you need about 160 000 messages