Security of cryptographic hash functions: Difference between revisions

Revision as of 21:28, 13 March 2022

Revision as of 08:07, 27 April 2022

Line 1:

{{Short description|None}}

In [[cryptography]], [[cryptographic hash functions]] can be divided into two main categories. In the first category are those functions whose designs are based on mathematical problems, and whose security thus follows from rigorous mathematical proofs, [[Computational complexity theory|complexity theory]] and [[Reduction (complexity)|formal reduction]]. These functions are called Provably Secure Cryptographic Hash Functions. To construct these is very difficult, and few examples have been introduced. Their practical use is limited.