Generation methodology
Passwords are selected uniformly from all strings that satisfy your chosen character groups, length and required-group rules. Random integers use crypto.getRandomValues with rejection sampling, avoiding modulo bias.
Displayed password bits are rounded down from log₂ of the number of valid strings. They describe the generator’s search space, not a promised cracking time. A password reused or exposed elsewhere is not protected by this number.
Passphrases sample independently from the 7,776-word EFF long list. Six words without a suffix provide about 77.5 bits. PINs allow leading zeroes. SHA-256/384/512 use Web Crypto; a matching checksum confirms byte equality against the supplied digest, not who published it.
No independent security audit is claimed. The implementation and reproducible examples below are available for inspection.
Example: with only the two symbols ! and ?, length 4 and no other groups, there are 2⁴ = 16 possible passwords: 4 bits.
Reviewed 10 September 2026. Generated values remain in browser memory; copying explicitly writes to your clipboard. Offline installation caches application files, never results.
Source code: generators · password policy