Entropy in Bits: L × log2(N) and a Rating Table
This lesson is part of the course
In this lesson
You convert search spaces into entropy bits with LOG(N, 2), rate five password types with an approximate VLOOKUP and find the length a random generator needs for 80 bits.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Character Sets & Search Space: N^L Locked
- Entropy in Bits: L × log2(N) and a Rating Table Locked
- Passphrases: Diceware-Style Word Lists & Bits per Word Locked
- Guesses per Second & Time to Crack: Online vs Offline Locked
- Length vs Complexity: An Entropy Grid & Line Chart Locked
- Policy Design: Length, Blocklists & MFA Compared Locked
- Password Reuse: 1 − (1 − p)^N Across Sites Locked
- Lockouts & MFA: Capping Online Guesses Locked