1.
Hashing in Information Security
Hashing is a one-way cryptographic function that converts input data (of any size) into a fixed-
size string of characters (hash value or digest). The primary purpose of hashing is to ensure data
integrity.
Key Properties of Hash Functions:
Deterministic: The same input always produces the same hash.
Fixed-Length Output: Regardless of input size, the hash has a fixed length (e.g., SHA-256
produces 256-bit hashes).
One-Way (Preimage Resistance): It should be computationally infeasible to reverse the
hash to get the original input.
Collision Resistance: It should be extremely difficult to find two different inputs that
produce the same hash.
Avalanche Effect: A small change in input drastically changes the hash.
Common Hashing Algorithms:
Algorith
Output Size Security Level Common Use Cases
m
Broken (collision-
MD5 128-bit Legacy systems (not recommended)
prone)
SHA-1 160-bit Weak (deprecated) Old certificates, Git (phasing out)
Blockchain, TLS, password storage
SHA-256 256-bit Secure
(with salt)
Variable (224, 256, 384,
SHA-3 Highly secure Next-gen security applications
512)
Applications of Hashing:
✔ Password Storage (with salt to prevent rainbow table attacks).
✔ File Integrity Checks (checksums for downloads, malware detection).
✔ Digital Signatures (used alongside encryption for authenticity).
✔ Blockchain & Cryptocurrencies (proof-of-work, transaction verification).
2. Digital Signatures in Information Security
A digital signature is a cryptographic technique that verifies the authenticity and integrity of a
message, software, or digital document. It ensures:
Authentication (sender is who they claim to be).
Non-repudiation (sender cannot deny sending the message).
Integrity (message was not altered in transit).
How Digital Signatures Work
1. Sender’s Side:
o The sender generates a hash of the message.
o The hash is encrypted with the sender’s private key (this is the digital signature).
o The original message + signature are sent to the receiver.
2. Receiver’s Side:
o The receiver decrypts the signature using the sender’s public key to retrieve the
original hash.
o The receiver independently hashes the received message.
o If both hashes match, the message is authentic and untampered.
Digital Signature Algorithms (DSAs):
Algorith
Based On Security Common Use Cases
m
Strong (but requires large
RSA Factorization SSL/TLS, Email (S/MIME)
keys)
Secure (but slower than
DSA Discrete Log Problem US Government standards
RSA)
Elliptic Curve Highly secure (shorter
ECDSA Bitcoin, Ethereum, IoT devices
Cryptography keys)
Modern protocols (e.g., SSH, TLS
EdDSA Edwards-curve DSA Fast & secure
1.3)
Applications of Digital Signatures:
✔ Secure Email (S/MIME, PGP) – Verifies sender identity.
✔ Code Signing – Ensures software hasn’t been tampered with (e.g., Windows drivers).
✔ Blockchain Transactions – Cryptocurrency transfers require digital signatures.
✔ Legal & E-Signatures – Legally binding documents (e.g., DocuSign).
Comparison: Hashing vs. Digital Signatures
Feature Hashing Digital Signatures
Authentication + Integrity + Non-
Purpose Data integrity check
repudiation
Encryption Used? No Yes (asymmetric encryption)
Reversible? No (one-way function) No (but verifiable with public key)
Output Fixed-length hash Encrypted hash (signature)
Common Use Password storage, file
SSL/TLS, code signing, blockchain
Cases checksums
Conclusion
Hashing ensures data integrity by generating a unique fingerprint of data.
Digital Signatures provide authentication, integrity, and non-repudiation by combining
hashing with public-key cryptography.
Both are essential in modern cybersecurity, from secure communications (TLS) to
blockchain and legal e-signatures.
Would you like a deeper dive into a specific hashing algorithm (like SHA-3) or digital signature
implementation (like ECDSA in Bitcoin)?
This response is AI-generated, for reference only.
New chat
