Overview#A Cryptographic Hash Function (One-Way Hash Function OWHF) is a Hash Function with some additional MUST have all Hash Function Security Properties.
Most Common Cryptographic Hash Function#The most commonly used Cryptographic Hash Function function today (2015-03-15) is SHA-1, which has output of 160 bits. (see SHAttered and SHA-1 Deprecation)
Strength of Cryptographic Hash Function#Unlike with Ciphers, the strength of a Cryptographic Hash Function doesn’t equal the Hash length. Because of the Birthday Paradox (a well-known problem in probability theory), the strength of a Cryptographic Hash Function is at most one half of the Hash length.
The harder it is to compute raises the Level Of Assurance.
Note that unlike hardness in most of complexity theory (e.g., NP-hardness), "hard" in the context of one-way functions refers to the Computational Hardness Assumption rather than worst-case hardness.
The existence of "pure" one-way functions is an open conjecture. for more information see Wikipedia:One-way_function
Cryptographic Hash Function and Hash Function properties#
More Information#There might be more information for this subject on one of the following:
- Bitcoin block
- Certificate Signature
- Cryptographic Hash Function Comparison
- Cryptographic Primitive
- Digital Signature
- Extendable-Output Function
- Hash Function
- Keyed-Hash Message Authentication Code
- Master Secret
- Merkle-Damgard construction
- Message Authentication Code
- Preimage Resistance
- Record Protocol
- Second Preimage Resistance
- Secure Hash Algorithm
- TLS 1.3
- Time-based One-time Password Algorithm
- Verifying Certificate Signatures
- Zero-knowledge proof