Interactive Audit Tool

Password Strength Checker

Evaluate mathematical entropy, brute-force crack times, and structural pattern penalties locally in your browser with PassCheck.

Analyzed locally · Never transmitted
0 characters
0/ 100
Estimated Strength

Enter Password

Calculated deterministically using information entropy, composition diversity, and pattern deductions.

Estimated Crack Resistance

Simulated Brute-Force Scenarios
Massive Offline Cluster
Instant
100 Billion hashes/sec (MD5/NTLM)
High-End Consumer GPU
Instant
1 Billion hashes/sec (SHA-256)
Slow Key Derivation
Instant
10,000 hashes/sec (bcrypt / Argon2)
Online Rate-Limited Attack
Instant
100 guesses / hour (Web Login)

Crack resistance is an estimate based on search space exhaustion (2^(E-1) average attempts). Real-world resistance also depends on password reuse and salt configurations.

Structural Security Findings

0 findings detected
No predictable patterns, keyboard walks, or repetitions detected.

Information Entropy

Very Weak Entropy
0bits of effective entropy
Character Pool0 possible
Raw Entropy0 bits
Deductions-0 bits

Entropy measures mathematical unpredictability based on character pool cardinality and structural pattern deductions.

Character Composition

0 unique chars (0% diversity)
Lowercase (a-z)
Uppercase (A-Z)
Numbers (0-9)
Special Symbols (!@#$)

Actionable Recommendations

  • •Use at least 16 characters.
  • •Combine uppercase, lowercase, numbers, and symbols.
  • •Avoid common dictionary words or predictable date patterns.

How PassCheck Calculates Strength

Traditional password strength meters rely solely on simplistic character counts. In contrast, PassCheck evaluates passwords across multi-dimensional threat models:

Shannon Information Entropy

Measures the total theoretical search space based on character pool cardinality (lowercase, uppercase, digits, symbols, unicode).

Spatial & Keyboard Patterns

Identifies adjacent keys on physical keyboards (QWERTY walks like 'qwerty' or 'asdfgh') that brute-force dictionaries prioritize.

Sub-String Repetitions

Detects token repetition chunks (e.g. 'abcabcabc' or 'adminadmin') that drastically collapse algorithmic entropy.

L33t-Speak & Common Dictionaries

Normalizes symbol substitutions (e.g. 'p@ssw0rd') against known compromised passwords.