N-Hash
Sign in to saveIn cryptography, N-hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 in an article by Miyaguchi, Ohta, and Iwata; weaknesses were published the following year.
Wikidata facts
- Instance of
- cryptographic hash function
- Based on
- FEAL
Show 1 more fact
- inception
- 1990-00-00
Sources (1)
via Wikidata · CC0
~2 min read
Encyclopedic overview
3 sectionsContents
- Design
- Cryptanalysis
- References
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 in an article by Miyaguchi, Ohta, and Iwata; 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 compression function. g contains eight rounds, each of which uses an F function, similar to the one used by FEAL.
Excerpted from Wikipedia’s “N-Hash” article, available under the CC BY-SA 4.0 licence.