Pick a length and the characters you want. The password is drawn in your browser, and the strength is the entropy of that draw.
Alphabet size: 62
Hit Generate and a fresh password shows up here.
A generated password is a sequence drawn at random from an alphabet you choose. The size of that alphabet and the length of the draw decide how many other passwords an attacker would have to try. That quantity is the entropy, written H = L × log₂(N), where L is the length and N is the number of allowed characters.
This tool draws the password in your browser with the Web Crypto random source, and it prints that entropy. The figure describes this draw. It is not a guess about a password a person invented, and it is not a promise about how fast a particular machine can hash.
0 , O , o , 1 , l , I and | should be left out. These examples show the entropy of a setting. They are not passwords to reuse. A real click draws different characters every time.
length 8, lowercase (N = 26)
8 × log₂(26) = 37.6 bits
length 20, lowercase, uppercase, digits, symbols (N = 94)
20 × log₂(94) = 131.1 bits
Under 28 bits the tag says Very weak, under 36 Weak, under 60 Fair, under 80 Strong, and from 80 upward Very strong. The bar is full at 80 bits. Sixteen characters from the 62 letters and digits land near 95.3 bits, so the bar is full.
length 4, digits → 4 × log₂(10) = 13.3 bits
length 16, digits → 16 × log₂(10) = 53.2 bits
Adding a symbol set grows the alphabet, and entropy only moves with the logarithm of that size. Going from 62 characters to 94 adds about 0.6 bit per character. Adding four characters of length adds far more. Length is the lever that moves the number.
Every character is drawn from the whole alphabet. A short password can miss a set you turned on. That is expected: the entropy formula counts every character that could have appeared, including the ones this particular draw did not use.
crypto.getRandomValues . Values that would bias a modulo are thrown away and drawn again, so every character in the alphabet is equally likely. 0 , O , o , 1 , l , I and | from whichever sets are on. !"#$%&'()*+,-./:;<=>?@[\]^_`{|}~NIST Special Publication 800-63B, published in June 2017, tells verifiers not to impose composition rules on memorized secrets. The guidance pushes length instead, because people answer “must include a symbol” with predictable tricks. A random generator is a different case: the alphabet size really is N in H = L × log₂(N), since the characters are not chosen by a person.
One bit is a yes-or-no question. A 4-digit PIN has about 13.3 bits, so about ten thousand possibilities. Eighty bits is 2⁸⁰ possibilities, which is why the bar on this page fills there. The number is the size of the draw, not a stopwatch.
The symbol set is the printable ASCII characters from ! (code 33) through ~ (code 126), with letters and digits removed. That leaves 32 symbols. Printable ASCII in that range is 94 characters, and 94 − 62 = 32.