view release on metacpan or  search on metacpan

librhash/snefru.c  view on Meta::CPAN

 *   J. Cryptology, Vol. 3, No 1, pp. 43-58, 1990
 *
 * Info from wikipedia:  Snefru is a cryptographic hash function invented
 * by Ralph Merkle in 1989 which supports 128-bit and 256-bit output.  It
 * was named after the Egyptian Pharaoh Sneferu, continuing the tradition
 * of the Khufu and Khafre block ciphers.
 *
 * 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 2^88.5 operations and is thus not currently feasible in practice.
 *
 * The algorithm can also be run with a variable number of "rounds" of the
 * internal algorithm. However, analysis by several cryptographers has shown
 * that SNEFRU has weaknesses that can be exploited, and that you can find
 * arbitrary messages that hash to a given 128-bit value if the 4-round
 * version is used. Dr. Merkle currently recommends that only 8-round SNEFRU
 * be used, but this algorithm is significantly slower than the MD5 or HAVAL