How Cryptographic Password Generation & Entropy Work
Why Web Crypto API Beats Standard Random Generators
Predictable passwords—such as dictionary words, birthdates, or keyboard patterns like Qwerty123!—are cracked within seconds by automated credential-stuffing and GPU brute-force rigs. Even basic programming functions like Math.random() are pseudo-random and unsuitable for security credentials. PureWebKits relies exclusively on your browser's native Web Crypto API (window.crypto.getRandomValues()), which draws high-entropy randomness directly from your operating system's cryptographic random number generator. Every character is chosen locally on your CPU with zero network requests.
How to Create & Use a Strong Password in 3 Steps
- Set Length & Character Sets: Slide the length bar to at least 16 characters and keep Uppercase, Lowercase, Numbers, and Special Symbols enabled.
- Check Entropy Score: Confirm the strength bar displays Very Strong (80+ bits of entropy). Optionally check Exclude Ambiguous Characters if you plan to type the password onto a smart TV or mobile device.
- Copy & Save in a Password Manager: Click Copy Password and store it safely inside a reputable password manager (such as Bitwarden, 1Password, or Apple/Google Passwords).
Password Entropy Mathematical Formula & Worked Example
Cryptographers measure password resistance against brute-force guessing in bits of entropy (E) using the character pool size (R) and password length (L):
Worked Example: Suppose you generate a 16-character password (L = 16) using all four standard ASCII character sets: 26 uppercase + 26 lowercase + 10 digits + 32 symbols = a pool of 94 possible characters (R = 94).
Calculating entropy: E = 16 × log₂(94) = 16 × 6.5546 = 104.87 bits.
With 2¹⁰⁴·⁸⁷ ≈ 3.7 × 10³¹ possible combinations, even a supercomputer testing one trillion guesses per second would require billions of years to exhaust the search space.