Password Hashing
summary
Demo of md5 shows a dictionary crack in ~2 seconds; PBKDF2 with iteration count 10,000 slows checks but cloud buys CPU so cost matters more than time; bcrypt is common but still CPU-only; modern choice is argon2 — memory‑hard so GPUs do far fewer parallel hashes (example: 12GB GPUs only run ~24 heavy instances comfortably); built a secure-password native binding atop libsodium with prebuilt binaries and async worker threads to avoid blocking Node and to keep hashing expensive for attackers while remaining responsive for users.
AI-written summary · about
chapters (14)
- 0:00Start
- 3:26Use Unique Passwords
- 5:10Plain Text
- 8:22Pre Image Resistant
- 8:45The Second Preimage Resistance
- 9:44Hash Functions
- 10:07Sha-1
- 13:51Solid Hashing
- 15:03Block Size
- 17:53Iterated Hashing
- 19:44Bcrypt
- 24:42Secure Password
- 37:27The Best Way How To Store Salt
- 38:53What Would You Recommend to Someone Who Never Worked with Security
related talks
27mKeeping passwords safe in 2017
36mThe Slower the Stronger: A Story of Password Hash Migration
51mThe Slower the Stronger: A Story of Password Hash Migration
46mCryptography For Beginners
43mPlease pass the salt: Serve up passwords with a side of entropy
25m80,000 Plaintext Passwords: An Open Source Love Story in Three Acts
34m80,00 Plaintext Passwords
47mPractical Security Foundations