Easing collision finding in cryptographic primitives with genetic algorithms

摘要: The finding of collisions (i.e. different inputs that map to the same output) in cryptographic primitives (hash functions or block ciphers) is an extremely difficult task. It generally requires hundreds thousands hours a talented cryptanalyst. Even this case, results are not always guaranteed. We present new method for easing collision finding, based on genetic algorithms. Our automatically seeks correlations between input and output bits can be used producing pseudocollisions parts output). These then useful creating full collision. ideas shown work over version cipher TEA reduced one round.