PDF p.357
In progress
Cryptographic Attacks
Summary
PDF p.357Cryptographic attacks exploit weaknesses in cryptographic systems to compromise authentication and data integrity. Common types include downgrade attacks, collision attacks, and birthday attacks.
Detailed explanation
PDF p.357-
Downgrade Attacks
- Definition: Forces a server or client to use a weaker protocol with weaker ciphers and key lengths.
- Example: Forcing the use of weak TLS or SSL versions.
- Kerberoasting: Targets Active Directory by obtaining service tickets and subjecting them to brute force attacks. Weaker encryption (e.g., RC4) makes it easier to crack passwords.
- Detection: Found in server logs or by intrusion detection systems.
-
Collision Attacks
- Definition: Exploits weak cryptographic hashing functions to generate the same hash for different plaintexts.
-
Mechanism
- Create a malicious and a benign document with the same hash.
- Submit the benign document for signing.
- Transfer the signature to the malicious document.
- Uses: Forging digital certificates, spoofing trusted websites, or making malware appear legitimate.
-
Birthday Attacks
- Definition: Exploits collisions in hash functions through brute force.
- Birthday Paradox: Shows that the probability of two items sharing the same hash is higher than expected.
-
Mechanism
- Create multiple variations of malicious and benign documents.
- Match hash outputs to exploit collisions.
- Effectiveness: A hash function with 128-bit hashes can be attacked by generating (2^{64}) variations, which is computationally feasible.
Important terms
taken from the text above- Downgrade Attacks
- Forces a server or client to use a weaker protocol with weaker ciphers and key lengths.
- Kerberoasting
- Targets Active Directory by obtaining service tickets and subjecting them to brute force attacks. Weaker encryption (e.g., RC4) makes it easier to crack passwords.
- Collision Attacks
- Exploits weak cryptographic hashing functions to generate the same hash for different plaintexts.
- Birthday Attacks
- Exploits collisions in hash functions through brute force.
- Birthday Paradox
- Shows that the probability of two items sharing the same hash is higher than expected.
- Effectiveness
- A hash function with 128-bit hashes can be attacked by generating (2^{64}) variations, which is computationally feasible.
What I should remember
Key Points PDF p.357-
Downgrade Attacks
- Weaker Protocols: Forces use of weak ciphers.
- Kerberoasting: Targets service account passwords.
- Detection: Server logs, intrusion detection.
-
Collision Attacks
- Weak Hash Functions: Generate same hash for different plaintexts.
- Mechanism: Malicious and benign document matching.
- Uses: Forging certificates, spoofing websites.
-
Birthday Attacks
- Exploits Collisions: Through brute force.
- Birthday Paradox: Higher probability of hash collisions.
- Mechanism: Multiple document variations.