Snefru

Snefru (named after the Egyptian pharaoh Sneferu ) is a technology developed by Ralph Merkle cryptographic hash function that computes a hash value of 128 or 256 bits in length for arbitrarily long messages.

Eli Biham and Adi Shamir were able to show with the help of the differential cryptanalysis, the uncertainty of the original design of Snefru, where they found message pairs with the same hash value within minutes.

The design was then changed so that the number of repetitions of the main passage of the algorithm has been increased.

For safety reasons, the use of Snefru with eight runs is recommended. However, the algorithm is then much more slowly than other common hash method.