N-hash

N-Hash is a function of chopping cryptographic based on the Chiffrement of block FERROALUMINIUM and suggested by Shoji Miyaguchi and Al in 1990. She is not regarded any more as a function cryptographiquement sure.

N-Hash produces a print of 128 bits. The message is divided into blocks of 128 bits and each block is combined with the value obtained hitherto by using a function of compression. This one contains 8 turns, each one of them calling upon a function F similar to that presents in FERROALUMINIUM.

In 1991, Eli Biham and Adi Shamir applied the Cryptanalyse differential to N-Hash and showed that the collisions could be generated more quickly than with the Paradoxe of the birthdays on alternatives based on a maximum of 12 turns.

References

  • Eli Biham, Adi Shamir: Differential Cryptanalysis off Ferroaluminium and N-Hash. EUROCRYPT 1991:1 - 16
  • S. Miyaguchi, K. Ohta, and Mr. Iwata: 128-bit hash function (N-hash) , NTT Review, 2 (6), November 1990, pages 128-132.

Random links:Sisteron | HRP-2 | Aure-and-saint-bosoms | Payment of the undue money in French civil law | Mechanical and practical application in French psychiatry | Manuscrit_de_Batak