Generate strong passphrases using the Diceware method with EFF word lists. Estimate entropy and crack time.
Diceware Passphrase Generator creates a passphrase by independently selecting words from an EFF Diceware list, then reports its entropy and an estimated time to search the possible combinations. Adding words increases the search space exponentially while keeping the result relatively readable. The main trap is replacing generated words with preferred ones while trusting the original estimate: that estimate assumes random word selection. Generation occurs in the browser, and the passphrase is not uploaded.
The EFF long list has 7,776 entries, corresponding to the 6^5 possible outcomes of rolling five six-sided dice. Each outcome identifies one word, and successive selections form an ordered passphrase. The browser tool performs the selections rather than requiring manual dice rolls. Spaces or other separators improve readability but are not the source of the word-selection entropy.
For N equally likely words and k independent selections, the possible sequence count is N^k and the entropy is k times log2(N). With the 7,776-entry EFF long list, each word contributes about 12.925 bits, so six words provide about 77.55 bits. The crack-time result converts this search space using a guessing-rate model; it is an estimate, not a guarantee.
There is no universal count. Match the word count to the consequence of compromise and the destination's length rules. On the 7,776-entry EFF long list, one independent word contributes about 12.925 bits, so six words represent about 77.55 bits before any human-chosen edits. More independently selected words increase the entropy linearly.
No. The selected list and word count determine the form and theoretical entropy, not a reproducible phrase. Each generation is intended to make new word selections. Store the chosen result securely if you need it again; the settings alone are not enough to reconstruct it.
The behavioral notes were checked against the browser implementation. Standards and primary references below define the relevant format, formula, or platform behavior.
Generate strong, random passwords with customizable length, character sets, and complexity requirements.
Analyze password strength with entropy scoring, crack-time estimates, and improvement suggestions.
Create cryptographically random strings for API keys, tokens, salts, and unique identifiers.
Create QR codes for URLs, text, Wi-Fi credentials, vCards, and more with customizable size and colors.
Scan and decode QR codes from uploaded images or your device camera to extract embedded data.
Compute MD5, SHA-1, SHA-256, and SHA-512 checksums to verify file integrity and detect tampering.