Security of cryptographic hash functions: Difference between revisions

Revision as of 19:42, 1 October 2013

Revision as of 02:11, 28 January 2014

Line 1:

{{Merge to|Cryptographic hash function|discuss=Talk:Provably secure cryptographic hash function#Restructuring proposal|date=January 2014}}

In [[cryptography]], [[cryptographic hash functions]] can be divided into two main categories. In the first category are those functions whose designs are based on a mathematical problem and thus their security follows from rigorous mathematical proofs, [[Computational complexity theory|complexity theory]] and [[Reduction (complexity)|formal reduction]]. These functions are called '''Provably Secure Cryptographic Hash Functions'''. However this does not mean that such a function could not be broken. To construct them is very difficult and only a few examples were introduced. The practical use is limited.