Credential Stuffing and Password Reuse Risk

Compromised credentials were the initial access vector in 22% of breaches Verizon reviewed in its 2025 DBIR. See how credential stuffing works and why reuse, not entropy, is the real vulnerability.

ZERO UPLOAD · ALL LOCAL
  1. Type or paste a password into the input field — strength updates instantly as you type.
  2. Check the entropy bits and strength tier in the meter below the input.
  3. Review the crack time table to see how long each attack scenario would take against your password.
  4. Read the feedback panel for specific suggestions if zxcvbn detected patterns or weaknesses.
  5. Use the eye icon to unmask the password if you need to review what you typed.

Credential stuffing by the numbers

  • Verizon 2025 DBIR 22% of breaches started with a compromised credential
  • Akamai ~193 billion credential stuffing attempts monitored in a single year
  • What stops it a unique password per service — not higher entropy
  • NIST's defense mandatory blocklist screening against known-breached credentials at creation

Type or paste a password to analyse its strength.

Length
Character pool
Entropy
Pattern
Attack Scenarios GPU times assume raw brute-force of a stolen hash. Online times use pattern-aware estimation against a live service.
GPU — Fast Hash (NTLM, MD5) Est. crack time
RTX 4070 Ti Super 155 GH/s · 16 GB GDDR6X
RTX 5070 175 GH/s · 12 GB GDDR7
RTX 4090 300 GH/s · 24 GB GDDR6X
RTX 5090 410 GH/s · 32 GB GDDR7
GPU — Slow Hash (bcrypt cost 12 / Argon2id) Est. crack time
RTX 4070 Ti Super 740 H/s * · 16 GB GDDR6X
RTX 5070 670 H/s * · 12 GB GDDR7
RTX 4090 1,440 H/s * · 24 GB GDDR6X
RTX 5090 2,380 H/s * · 32 GB GDDR7
Online Attack Est. crack time
Throttled 100 guesses/hour — rate-limited login service
Unthrottled 10 guesses/second — no rate limiting

* bcrypt and Argon2id are deliberately slow password hashes, so their crack times depend entirely on the cost factor a site configures. These rates assume bcrypt at cost factor 12, a conservative legacy setting. OWASP's current guidance prefers Argon2id for new systems and lists bcrypt as a legacy fallback with a work factor of 10 or more. Published hashcat v6.2.6 benchmarks measure bcrypt at cost factor 5 (RTX 4090 at 184 kH/s, RTX 5090 at 305 kH/s); each step up the cost factor doubles the work, so cost 12 runs 128 times slower than the benchmark default. The RTX 4090 and RTX 5090 figures divide those benchmarks by 128, while the RTX 4070 Ti Super and RTX 5070 figures are scaled from their SM and core counts. Sources: hashcat RTX 4090, hashcat RTX 5090, and the OWASP Password Storage Cheat Sheet.

Credential Stuffing and Password Reuse Risk

Twenty-two percent: that is the share of breaches in Verizon's 2025 Data Breach Investigations Report that started with a compromised credential rather than a software exploit.1 Most of those compromised credentials were not cracked through brute force at all. They were stolen from one breached service and replayed automatically against hundreds of others, a technique called credential stuffing. This matters because credential stuffing sidesteps the entire entropy conversation this tool is built around; a password can carry 128 bits of theoretically perfect randomness and still fall to a stuffing attack if you reused it somewhere that already leaked. This page explains exactly how the attack works, why reuse rather than weakness is the enabling condition, and what actually stops it.

How credential stuffing actually works

An attacker starts with a list of username-password pairs pulled from a previous breach, sometimes numbering in the billions of entries.1 Instead of guessing, automated bots simply replay each known-correct pair against the login pages of hundreds of other, unrelated services, betting that some fraction of users reused that same password elsewhere. Akamai has reported roughly 193 billion credential stuffing attempts occurring across the services it monitors in a single year.2

Why bots, not brute force

Because this attack replays credentials that are already verified correct somewhere, the bots do not need to guess anything. They need volume, automation, and enough distributed infrastructure, rotating IP addresses and browser fingerprints, to avoid the rate limiting that protects against a slower, manual brute-force attempt at the same login form.

A successful stuffing attempt looks identical to a normal login from the target service's perspective, since the credentials really are correct. That indistinguishability is what makes stuffing so hard to defend against with rate limiting alone; the traffic pattern only becomes suspicious once volume or velocity across many accounts reveals the automation behind it.

Why password reuse is the enabling condition, not the password's entropy

Credential stuffing changes what 'strong' means in practice. A password can carry enough entropy to resist any brute-force attack an attacker could ever mount, and NIST would rate it as effectively unbreakable by guessing, yet it still fails completely under credential stuffing if the same exact password was used on another service that later suffered a breach; the breach itself does not target password strength, it merely releases a correct credential that bots replay elsewhere.

Why entropy is not the variable that matters here

Credential stuffing does not care how strong your password is. It only cares whether the exact password it already has on file for you still works somewhere else. A password with 100 bits of entropy, generated randomly and impossible to brute-force in any practical timeframe, offers zero protection against stuffing the moment it is reused across two services and one of them is breached.3

This is precisely the gap raw entropy calculations cannot close. Entropy measures resistance to guessing; credential stuffing is not a guessing attack. The variable that determines whether you are vulnerable to stuffing is uniqueness across services, a property entirely independent of how many bits any single password carries on its own.

What actually stops credential stuffing

A unique password per service breaks the replay mechanism completely, since a leaked pair from one breach simply does not match the password used anywhere else. Multi-factor authentication adds a second layer that a stolen password alone cannot satisfy, stopping most stuffing attempts even when the underlying password happens to match.

The service side of the defense, and the reliable personal fix

NIST's current guidance formalizes part of this defense on the service side: verifiers SHALL screen new passwords against a blocklist of known compromised credentials, catching some reused, already-breached passwords at the point of creation rather than after an attack succeeds.4 On your side, the reliable fix is structural: a password manager that generates and stores a distinct password for every account removes reuse as a possibility entirely, and it costs nothing extra to confirm a generator actually reaches target entropy rather than relying on memory or discipline to maintain it manually. Trying to remember dozens of genuinely unique passwords without a manager is not realistic for most people, which is exactly why reuse remains so common despite widespread awareness that it carries risk.5

When to use this

Think about credential stuffing specifically whenever you catch yourself reusing a password, even a strong one, across more than one account. It is also the right lens for understanding why a breach at a service you barely use can still put your email or banking login at risk if you shared a password between them, especially for accounts you signed up for years ago and rarely think about now. A quick audit of your password manager for reused entries is a reasonable place to start closing that exposure.

Examples

Using the same strong, randomly generated password for a forum account and your email

If the forum is breached, that password is now tested against your email login too. Entropy did not fail here; reuse did.

Getting a 'this password was found in a data breach' warning while creating a new account

That warning is blocklist screening at work. Choose a different, unique password rather than a minor variation of the flagged one.

Sources
  1. 1.

    Verizon, "Additional 2025 DBIR research on credential stuffing," verizon.com, 2025. https://www.verizon.com/business/resources/articles/credential-stuffing-attacks-2025-dbir-research/

  2. 2.

    DeepStrike, "Credential Stuffing Statistics 2026," deepstrike.io, 2026. https://deepstrike.io/blog/credential-stuffing-statistics

  3. 3.

    OWASP, "Credential Stuffing Prevention Cheat Sheet," cheatsheetseries.owasp.org, accessed July 2026. https://cheatsheetseries.owasp.org/cheatsheets/Credential_Stuffing_Prevention_Cheat_Sheet.html

  4. 4.

    NIST, "Authenticators," SP 800-63-4, pages.nist.gov, accessed July 2026. https://pages.nist.gov/800-63-4/sp800-63b/authenticators/

  5. 5.

    Wikipedia, "Credential stuffing," en.wikipedia.org, accessed July 2026. https://en.wikipedia.org/wiki/Credential_stuffing

FAQ