N-Hash

From Infogalactic: the planetary knowledge core

Jump to: navigation, search

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 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 collisions could be generated faster than by a birthday attack for N-Hash variants with even up to 12 rounds.

References

Eli Biham, Adi Shamir: Differential Cryptanalysis of Feal and N-Hash. EUROCRYPT 1991: 1–16
S. Miyaguchi, K. Ohta, and M. Iwata: "128-bit hash function (N-hash)", NTT Review, 2(6), November 1990, pp128–132.

v t e Hash functions & message authentication codes
Security summary
Common functions	MD5 SHA-1 SHA-2 SHA-3/Keccak
SHA-3 finalists	BLAKE Grøstl JH Skein Keccak (winner)
Other functions	FSB ECOH GOST HAS-160 HAVAL Kupyna LM hash MDC-2 MD2 MD4 MD5 MD6 N-Hash RadioGatún RIPEMD SipHash Snefru Streebog SWIFFT Tiger VSH WHIRLPOOL crypt(3) (DES)
MAC algorithms	DAA CBC-MAC HMAC OMAC/CMAC PMAC VMAC UMAC Poly1305
Authenticated encryption modes	CCM CWC EAX GCM IAPM OCB
Attacks	Collision attack Preimage attack Birthday attack Brute force attack Rainbow table Side-channel attack Length extension attack
Design	Avalanche effect Hash collision Merkle–Damgård construction
Standardization	CRYPTREC NESSIE NIST hash function competition
Utilization	Salt Key stretching Message authentication
Key derivation functions	bcrypt PBKDF2 scrypt

v t e Cryptography
History of cryptography Outline of cryptography Cryptographic protocol Authentication protocol Cryptographic primitive Cryptanalysis Cryptocurrency Cryptosystem Cryptographic nonce Cryptovirology Hash function Cryptographic hash function Key derivation function Digital signature Kleptography Key (cryptography) Key exchange Key generator Key schedule Key stretching Keygen Cryptojacking malware Ransomware Random number generation Cryptographically secure pseudorandom number generator (CSPRNG) Pseudorandom noise (PRN) Secure channel Insecure channel Subliminal channel Encryption Decryption End-to-end encryption Harvest now, decrypt later Information-theoretic security Plaintext Codetext Ciphertext Shared secret Trapdoor function Trusted timestamping Key-based routing Onion routing Garlic routing Kademlia Mix network
Cryptographic hash function Block cipher Stream cipher Symmetric-key algorithm Authenticated encryption Public-key cryptography Quantum key distribution Quantum cryptography Post-quantum cryptography Message authentication code Random numbers Steganography
Category