Category:Computational hardness assumptions

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 content has been reduced to only pages contained in the ZIM file.

This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.