BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Security

198Hash Function Fundamentals
199Preimage Resistance
200Second Preimage Resistance
201Collision Resistance
202The Birthday Paradox and Collision Probability
203Determinism and Avalanche Effect
204Fixed-Length Output Property
205Computational Efficiency Requirements
206Non-Reversibility and One-Way Property
207Hash Function Security Margins
208MD5 and SHA-1: Broken Hash Functions
209SHA-2 Family: SHA-224, SHA-256, SHA-384, SHA-512
210SHA-3 and the Keccak Algorithm
211Collision Attacks: Theory and Practice
212Preimage and Second Preimage Attacks
213Length Extension Attacks
214Birthday Attacks and Hash Output Size
215Specialized Hash Functions: BLAKE2, BLAKE3
216Hash Function Selection in Modern Systems
217HMAC Construction and Security Properties
218HMAC vs Plain Hashing: Length Extension Attacks
219HMAC Key Management and Key Derivation
220Timing Attacks on MAC Verification
221HMAC in Authentication Protocols
222Encrypt-then-MAC vs MAC-then-Encrypt
223HMAC Truncation and Output Length Selection
224Alternative MAC Constructions: KMAC and Poly1305
225Digital Signature Fundamentals and Use Cases
226RSA Signature Schemes (PKCS#1 v1.5 and PSS)
227ECDSA: Elliptic Curve Digital Signature Algorithm
228EdDSA and Ed25519 Signatures
229Signature Verification and Common Pitfalls
230Code Signing and Software Integrity
231Document Signing and PDF Signatures
232Detached Signatures and Signature Formats
233Blind Signatures and Anonymous Credentials
234Signature Performance and Implementation Considerations
235Blind Signatures and Unlinkability
236Ring Signatures and Group Anonymity
237Multisignatures and Threshold Signatures
238EdDSA and Modern Signature Standards
239Aggregate Signatures and Batch Verification
240Forward-Secure and Stateful Signatures

Security

198Hash Function Fundamentals
199Preimage Resistance
200Second Preimage Resistance
201Collision Resistance
202The Birthday Paradox and Collision Probability
203Determinism and Avalanche Effect
204Fixed-Length Output Property
205Computational Efficiency Requirements
206Non-Reversibility and One-Way Property
207Hash Function Security Margins
208MD5 and SHA-1: Broken Hash Functions
209SHA-2 Family: SHA-224, SHA-256, SHA-384, SHA-512
210SHA-3 and the Keccak Algorithm
211Collision Attacks: Theory and Practice
212Preimage and Second Preimage Attacks
213Length Extension Attacks
214Birthday Attacks and Hash Output Size
215Specialized Hash Functions: BLAKE2, BLAKE3
216Hash Function Selection in Modern Systems
217HMAC Construction and Security Properties
218HMAC vs Plain Hashing: Length Extension Attacks
219HMAC Key Management and Key Derivation
220Timing Attacks on MAC Verification
221HMAC in Authentication Protocols
222Encrypt-then-MAC vs MAC-then-Encrypt
223HMAC Truncation and Output Length Selection
224Alternative MAC Constructions: KMAC and Poly1305
225Digital Signature Fundamentals and Use Cases
226RSA Signature Schemes (PKCS#1 v1.5 and PSS)
227ECDSA: Elliptic Curve Digital Signature Algorithm
228EdDSA and Ed25519 Signatures
229Signature Verification and Common Pitfalls
230Code Signing and Software Integrity
231Document Signing and PDF Signatures
232Detached Signatures and Signature Formats
233Blind Signatures and Anonymous Credentials
234Signature Performance and Implementation Considerations
235Blind Signatures and Unlinkability
236Ring Signatures and Group Anonymity
237Multisignatures and Threshold Signatures
238EdDSA and Modern Signature Standards
239Aggregate Signatures and Batch Verification
240Forward-Secure and Stateful Signatures

← Security

Lesson 201 of 3,052·5. Cryptographic Hashing and MACsPro lesson

Collision Resistance

Exploring why finding any two different inputs that produce the same hash must be computationally hard.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course