Hash Functions Taste Great with Anything
summary
Defines practical hash use: fast noncryptographic hashes for data structures, cryptographic hashes and salting for passwords, and Bloom filters for space-efficient membership. Shows numbers: 5,000 images need 7188 bits (8.8 KB) and about 10 hash functions for a 0.1% false positive rate. Recommends murmur3 for avalanching noncrypto hashing (used in Hadoop, Cassandra, nginx), warns MD5 is too fast (1M MD5/s on cheap VM) and prefers bcrypt/scrypt with per-user salts (bcrypt defaults turn that million-hash run into days).
AI-written summary · about
chapters (7)
- 0:00Introduction and setup
- 2:25Defining hash functions
- 4:12Understanding hash tables
- 7:40Working with bloom filters
- 14:56Selecting hash functions
- 17:59Hashes in security
- 22:27Security best practices
related talks
42mPassword Hashing
46mCryptography For Beginners
08m⚡ Lightning Talk: Would a Gradual Rollout by Any Other Hashing Algorithm Still Smell as Sweet?
07mHashing
47mPractical Security Foundations
27mKeeping passwords safe in 2017
36mThe Slower the Stronger: A Story of Password Hash Migration
49mSalt Your Password Well: Password Hashes on the Web