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.
Pages in category "Computational hardness assumptions"
The following 25 pages are in this category, out of 25 total. This list may not reflect recent changes.