View source for N-Hash

In [[cryptography]], '''N-Hash''' is a [[cryptographic hash function]] based on the [[FEAL]] round function, and is now considered insecure. It was proposed in 1990 by Miyaguchi et al.; weaknesses were published the following year.

N-Hash has a 128-bit hash size. A message is divided into 128-bit blocks, and each block is combined with the hash value computed so far using the ''g'' [[One-way compression function|compression function]]. ''g'' contains eight rounds, each of which uses an ''F'' function, similar to the one used by [[FEAL]].

[[Eli Biham]] and [[Adi Shamir]] (1991) applied the technique of [[differential cryptanalysis]] to N-Hash, and showed that [[hash collision|collision]]s could be generated faster than by a [[birthday attack]] for N-Hash variants with even up to 12 rounds.

==Source==

[http://wikipedia.org/ http://wikipedia.org/]
[[Category:Cryptography]]