Cryptography with Python 25: Hash function security

⏰ Timestamps for content in this video ⏰

00:00 Hash function security
01:01 Requirements on one-wayness
02:13 Requirements on collision resistance
05:05 Requirements on second pre-image resistance
06:32 Insecurity of MD5 and SHA-1, security of SHA-2 and SHA-3

🔷🔷 About 🔷🔷

This Fundamental Cryptography in Theory and Python lesson presents essential security requirements for hash functions to be considered secure. The lesson then presents, why MD5 and SHA-1 are considered insecure hash functions, and why SHA-2 and SHA-3 are considered secure hash functions.

📝 Resources used and created for code lessons 📝

🔗 Links included in this video 🔗

[cyrillgossi]

📝 All resources used and created for code lessons can be found here:

[metulusoy]

In the slide at 2:16, you can't always find such a pair. Probability of finding such a pair is slightly less than 0.5.
In the slide at 5:05, you can't always find x1 in 2^n steps. Probability of finding x1 in 2^n steps is 1-1/e.