Content deleted Content added
→Types of security of hash functions: Added Oxford Comma for clarity, and expanded <math> brackets to clearly define the difference between the math and sentence |
Removing stale merge proposal from January 2014; missed when the merge discussion was resolved; see Talk:Security of cryptographic hash functions#Move Proposal |
||
Line 1:
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.
| |||