
Hash Functions and Digital Signatures —two core topics in Information Security that work closely together to ensure data integrity, authenticity, and non-repudiation .
Hash Functions and Digital Signatures—two core topics in Information Security that work closely together to ensure data integrity, authenticity, and non-repudiation.
A hash function is a mathematical algorithm that takes input data of any size and produces a fixed-size output (called a hash or digest).
| Property | Explanation |
|---|---|
| Deterministic | Same input always gives the same output |
| Fast | Quickly computes the hash |
| Irreversible (One-way) | You can't get the original input from the hash |
| Collision-resistant | Two different inputs should not produce the same hash |
| Avalanche effect | Small change in input → drastically different hash |
A digital signature is a cryptographic technique that verifies:
| Hash Function | Digital Signature |
|---|---|
| One-way, fixed-size output | Uses hash of data + encryption |
| Ensures integrity | Ensures authenticity, integrity, and non-repudiation |
| Fast and irreversible | Based on asymmetric encryption |
| Example: SHA-256 | Example: RSA with SHA-256 |
Think of a hash like a fingerprint of a file.
A digital signature is like a fingerprint that's been stamped with your unique seal (private key), proving it’s yours and hasn’t been altered.
Open this section to view and download past papers
Click on Show Past Papers to load available exam papers.