Content deleted Content added
m →The meaning of "hard": ce |
→The meaning of "hard": the "difficulty" of a problem depends on its size - give a practical example |
||
Line 16:
The second approach is theoretical and is based on the [[computational complexity theory]]. If problem A is hard, there exists a formal [[Reduction (complexity)|security reduction]] from a problem which is widely considered unsolvable in [[polynomial time]], such as [[integer factorization]] problem or [[discrete logarithm]] problem.
However, non-existence of a polynomial time algorithm does not automatically ensure that the system is secure.
==Classical hash functions - practical approach to security==
| |||