# Category:Computational hardness assumptions

Jump to navigation
Jump to search

Computational hardness assumptions play an important role in cryptography; in particular for Provable security. Such an assumption conjectures that the corresponding computational problem is hard. Most of the time hard is meant to mean not to be solved by a polynomial time probabilistic Turing machine.

*This category currently contains no pages or media.*