I have a homework to find the longest possible hash collision for a given hash (counting the first n characters for a collision of length n). So the strings ABCDE and ABDDE would have a collision length of 2. Do you have any advice on how I can implement this? I was thinking of maybe going for a dictionary attack instead of brute-force. But I’m ultimately not sure a) how to actually do that? like where even get an appropriate dictionary? and b) if the clear text even would in a dictionary or if it’s just a random string. I was also thinking using multiple threads to just try things faster but I’m not sure what the ideal amount of threads would be or if/how I would even benefit from multi-threading at all. Any practical advice is very appreciated.