# Snefru

The original design of Snefru was shown to be insecure by Eli Biham and Adi Shamir who were able to use differential cryptanalysis to find hash collisions. The design was then modified by increasing the number of iterations of the main pass of the algorithm from two to eight. Although differential cryptanalysis can break the revised version with less complexity than brute force search (a certificational weakness), the attack requires ${\displaystyle 2^{88.5}}$ operations and is thus not currently feasible in practice.[2]
2. ^ Eli Biham (2008-07-19). "Fast Software Encryption". Lecture Notes in Computer Science. 5086: 444–461. doi:10.1007/978-3-540-71039-4_28. ISBN 978-3-540-71038-7. `|chapter=` ignored (help)