| Field | Value | Comment | Copy |
|---|---|---|---|
| {{ row.label }} | {{ row.value }} | {{ row.comment }} |
| Machine | Rate (guesses/s) | Estimated time | Copy |
|---|---|---|---|
| {{ c.machine }} | {{ c.rateDisplay }} | {{ c.time }} |
| Metric | Value | Copy |
|---|---|---|
| Entropy bits (log₂(charsetⁿ)) | {{ entropyBits.toFixed(1) }} | |
| Interpretation | {{ entropyComment }} |
Passwords are secret phrases that prove identity and protect access. Strength describes how many guesses an attacker would need, so it signals practical resistance against trial attempts. Use a password entropy calculator to see how length and character variety change exposure.
Type a candidate string and read a plain description with an overall score, then review estimated crack time across machines with different guess rates. You can also set a slowdown factor to model slower hashing so estimates reflect hardened verification.
Results include entropy in bits, simple warnings about repeated or sequential characters, and a quick dictionary check for very common choices. A longer phrase with mixed character types typically raises entropy and pushes estimates upward, which is the goal for durable credentials.
A short or predictable string may still be weak even if it includes many character types, so interpret the warnings alongside the entropy figure. For safety, try examples rather than real account passwords and avoid sharing secrets during testing.
Password strength is modeled as the size of the search space an attacker must explore. The key quantity is information content measured in bits of entropy, describing how many equally likely possibilities a password represents.
Entropy grows with length and with the effective character set used. If a password uses digits, uppercase and lowercase letters, and symbols, the set expands; the model treats each position as an independent draw from that set. Crack‑time estimates divide the total combinations by a chosen guess rate and can be scaled by a slowdown factor to reflect costly verification.
Results are summarized as a descriptive label and entropy ranges. Crossing a band edge moves the label from weak to strong, but values near boundaries should be read with caution because small changes in length or character mix can shift the outcome.
Comparisons assume random selection from the effective set and do not capture human patterns beyond basic checks for dictionary hits, repeats, sequences, email‑like forms, and dates. Use the figures to compare alternatives rather than to certify a secret.
| Symbol | Meaning | Unit/Datatype | Source |
|---|---|---|---|
| n | Password length | characters | Input |
| S | Effective character set size | symbols | Derived |
| H | Entropy | bits | Derived |
| R | Guess rate (per machine) | guesses/s | Constant |
| T | Estimated exhaustive time | seconds or years | Derived |
| Threshold band | Lower | Upper | Interpretation | Action cue |
|---|---|---|---|---|
| Very weak | 0 | < 40 | Easily guessed | Increase length and variety |
| Weak | 40 | < 60 | Low resistance | Add words or symbols |
| Reasonable | 60 | < 80 | Moderate resistance | Prefer longer phrases |
| Strong | 80 | < 100 | High resistance | Keep unique per site |
| Very strong | ≥ 100 | — | Very high resistance | Still avoid reuse |
| Parameter | Meaning | Unit/Datatype | Typical range | Notes |
|---|---|---|---|---|
| Hash slowdown factor | Scales down guess rate to model costly verification | number | 1 to 10,000,000 | Neutral default 1; affects time only |
| Field | Type | Min | Max | Step/Pattern | Error text | Placeholder | Notes |
|---|---|---|---|---|---|---|---|
| Password | text | — | — | — | — | Type a password… | Eye toggle shows or hides characters |
| Hash slowdown factor | number | 1 | — | step 1 | — | — | Applies to crack‑time calculations |
| Input | Accepted families | Output | Encoding/Precision | Rounding |
|---|---|---|---|---|
| Password string | Printable characters | Tables, warnings, entropy, crack‑times, JSON | Text, numeric, CSV/JSON exports | Entropy 1 decimal; times rounded to units |
No data is transmitted or stored server‑side; all computations occur in the browser. Avoid entering sensitive credentials from production accounts.
Password strength assessment estimates entropy and crack‑time to guide safer choices.
Example: Add one word and a symbol to a short base, then recheck entropy; expect a notable increase.
Choose the variant that maximizes entropy while staying memorable and unique.
No. Analysis runs locally and nothing is sent to a server. One network request retrieves a common‑password list.
Avoid testing real account passwords.They model exhaustive search against an assumed rate. Real attacks vary by algorithm, hardware, and defenses like lockouts.
Entropy is in bits with one decimal. Guess rates use SI suffixes. Times show minutes, hours, days, years, or powers of ten.
Yes for analysis. The dictionary check needs a prior successful download or it will report as not loaded.
Values near a band edge may flip with small changes. Prefer longer phrases that push clearly into higher ranges.
This tool assesses passwords only. It does not parse or validate certificate signing requests.
Length helps, but predictable patterns and reuse still create risk. Use unique phrases and enable multifactor.
It scales time estimates by reducing the effective guess rate. It does not affect entropy or warnings.