Tools & 3D Studio
← All tools

PassForge · passwords & tokens · zero upload

Passwords the tab never sends.
Entropy counted in bits.
Nothing leaves the device.

Six props: the browser's own crypto.getRandomValues as the only source, rejection sampling so no character is favoured, the exact entropy of what you got, and an offline crack time from that number. Passwords, word passphrases, UUID v4 and time-ordered v7, 256-bit API tokens.

0 bytes uploaded 0 external requests crypto.getRandomValues entropy in bits

Password

8–64 characters · uniform draw
chars
items
Length

How the randomness is made

measured, not promised

01Random source and bias

crypto.getRandomValues asks the operating system for bytes — the same generator the browser uses for TLS. 232 does not divide by N, so a plain x % N would favour the first (232 mod N) characters — with N = 90 that is 76 characters, each about 0.0000021% likelier. Rejection sampling discards every draw at or above the largest multiple of N that fits in 32 bits, then takes the remainder, so all 90 characters are equally likely and the bit count above is exact.

02Entropy, then time

Entropy is the base-2 log of how many equally likely results exist. A password is L × log₂(N); a passphrase is W × log₂(list) plus 3.3 bits for an appended digit. The crack time is that space halved and divided by the guess rate. Doubling the length adds bits linearly; adding a character class changes N by a few dozen — length wins.

bitsmeaning
< 50weak
50–75fair
75–100strong
≥ 100beyond brute force

03Which format for what

A password is for one site, pasted once, never typed. A passphrase is for the vault master key or a device you unlock by hand. UUID v4 is a random 122-bit identifier; v7 puts a millisecond timestamp first so rows sort by creation time and still index well in a database. A 256-bit token is for API keys and reset links. None of these is a substitute for a password manager and a second factor.

Questions

randomness · entropy · formats
Is Math.random good enough if I am in a hurry?
No. Math.random is not a cryptographic generator: its internal state can be recovered from a handful of outputs, and browsers seed it without a guarantee about quality. Any password made from it is guessable in principle even if it looks random. This page never calls it.
Why is my 12-character password weaker than 5 words?
Because of the pool. Twelve characters over 92 symbols is 78 bits; five words over the built-in list is 48 bits, so the 12-character password actually wins — until you count how people choose characters, which is not uniformly. The honest comparison is between generated strings, and then a 20-character password (130 bits) beats a passphrase only if you will paste it every time. For something you must remember, six or seven words is the better trade.
Should I skip 0O1lI?
Skip them when a human will retype the string — a Wi-Fi key, a recovery code written on paper. It removes 5 characters from the pool (N 90 → 85, about 0.08 bits per character), which costs almost nothing. For a password you paste from a manager, leaving them in is strictly better.
What does the footer counter actually watch?
A PerformanceObserver on resource entries. Anything fetched from a different origin — a font, an image, a script, a beacon — increments it. The page is one file with no external reference, and it also refuses to write anything to storage except the language you chose, so a reload starts clean.