Snefru is acryptographic hash function invented byRalph Merklein 1990 while working atXerox PARC.[1]The function supports 128-bit and 256-bit output. It was named after theEgyptianPharaohSneferu, continuing the tradition of theKhufu andKhafreblock ciphers.
The original design of Snefru was shown to be insecure byEli Biham andAdi Shamir who were able to usedifferential 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 thanbrute force search (a certificational weakness), the attack requires operations and is thus not currently feasible in practice.[2]
{{cite book}}: CS1 maint: location (link) CS1 maint: location missing publisher (link)This cryptography-related article is astub. You can help Wikipedia byadding missing information. |