Overview#Computational Hardness Assumption implies the Confidentiality of the message is Computationally Secure which implies assuming that any attacker is computationally limited.
In some cases, cryptographic protocols are found to be Information-theoretic Secure; the one-time pad is a common example. However, Information-theoretic Secure cannot always be achieved; in such cases, cryptographers fall back to Computational Hardness Assumption.
Roughly speaking, this means that these systems are secure assuming that any adversaries are computationally limited, as all adversaries are in practice. Because hardness of a problem is difficult to prove, in practice certain problems are "assumed" to be difficult.
More Information#There might be more information for this subject on one of the following:
- Attack Effort
- Collision Resistance
- Cryptographic Collision
- Cryptographic Hash Function
- Cryptographically Weak
- Cryptographically secure pseudorandom number generator
- Distributed Consensus
- Information-theoretic Secure
- Preimage Resistance
- Pseudorandom generators
- Second Preimage Resistance
- Threat Model
- Verifying Certificate Signatures