# N-Hash

> obsolete cryptographic hash function

**Wikidata**: [Q2354940](https://www.wikidata.org/wiki/Q2354940)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/N-hash)  
**Source**: https://4ort.xyz/entity/n-hash

## Summary
N-Hash is an obsolete cryptographic hash function created in 1990. It is a special class of hash function designed for cryptographic applications and is based on the FEAL block cipher. Due to its age and subsequent cryptographic advances, it is no longer considered secure for use.

## Key Facts
- **Classification:** Cryptographic hash function
- **Status:** Obsolete
- **Inception:** 1990
- **Technical Basis:** Based on the FEAL block cipher
- **Wikipedia Sitelinks:** 6 language editions

## FAQs
### Q: What is N-Hash?
A: N-Hash is an obsolete cryptographic hash function developed in 1990. It was designed to create a unique digital fingerprint for data but is no longer considered secure for modern applications.

### Q: When was N-Hash created?
A: N-Hash was created in 1990.

### Q: What algorithm is N-Hash based on?
A: The design of N-Hash is based on the FEAL block cipher.

### Q: Is N-Hash still used today?
A: No, N-Hash is considered obsolete. It is not recommended for any security applications due to vulnerabilities discovered in older cryptographic algorithms.

## Why It Matters
N-Hash represents a specific era in the development of cryptographic hash functions. Created in 1990 and based on the FEAL block cipher, it is an example of early attempts to build secure hashing algorithms from existing cryptographic primitives. Its subsequent obsolescence is significant because it illustrates the rapid and continuous evolution of cryptography.

The lifecycle of algorithms like N-Hash highlights the constant "cat-and-mouse" game between cryptographers and cryptanalysts. As new attack methods are discovered, older functions are proven insecure and must be replaced by stronger, more complex designs. Studying N-Hash provides historical context for understanding why modern standards like the SHA-2 and SHA-3 families were developed and why the cryptographic community constantly works to phase out legacy systems. It serves as a case study in the finite lifespan of cryptographic algorithms.

## Notable For
- **Obsolescence:** N-Hash is primarily known today as an obsolete algorithm, serving as an example of a hash function that is no longer secure.
- **FEAL-Based Design:** Its construction is based on the FEAL (Fast data Encipherment ALgorithm) block cipher, a specific design choice from its time.
- **1990s Era Cryptography:** As an algorithm from 1990, it represents the state of hash function design from that period, prior to the development of more modern standards.

## Body
### Classification and Status
N-Hash is an instance of a cryptographic hash function. This is a special class of hash function with properties that make it suitable for use in cryptography, such as pre-image resistance and collision resistance. The function is now considered obsolete and is not suitable for modern security needs.

### History and Design
N-Hash was developed in 1990. Its internal structure and cryptographic properties are derived from the FEAL block cipher, a common design strategy for hash functions of that era.

## References

1. Freebase Data Dumps. 2013