The Brute Force Attack — Comprehensive Operation

Project reference document Time2Crack
Recipients: developers, security researchers, advanced users

Contents

  1. Overview
  2. Historical and academic background
  3. Math: Keyspace and entropy
  4. Effective defences
  5. References

1. Overview

Crude force is the most fundamental attack in password cracking: it consists of testing systematically all possible combinations No intelligence, no heuristic — only the raw computing power against the size of the space to travel.

In Time2Crack, brute force plays a double role:

  • Modeled attack It represents the maximum theoretical time that an attacker would put, assuming no other exploitable vulnerability.
  • Floor (monotonicity guard) : it serves as a lower terminal for all other attacks — no specialized attack can legitimately display a time less than that which would take raw force on the alphabetical sub-chain of the password.
  • In practice, raw force is almost never the fastest attack on a real human password — PCFG, Markov or hybrid attack will be more effective. But for a truly random and long password, it represents reality: the attacker has no choice but to browse the space exhaustively.

    2. Historical and academic background

    2.1 Origins

    The raw force precedes the computer: the principle of testing all possible combinations is used since the first mechanical encryption machines (Enigma during the Second World War). The bomb of Alan Turing was, in a broad sense, a device of raw force forced by a hypothesis of cribs.

    With the advent of computers, the unix password force was formalized from the 1970s to the 1980s:

    YearEvent
    1979Morris & Thompson: First academic article on Unix password security, with raw force analysis on /etc/passwd
    1988Morris Worm: first mass feat using, among other things, a dictionary and raw force password crack
    1993Crack 5.0 (Alec Muffett): first public cracking tool by raw force on Unix
    2004Ophcrack : groove tables + raw force on LM/NTLM hashes Windows
    2007GPU-accelerated cracking (Elcomsoft): first public use of the GPU to accelerate gross force
    2012Hashcat open source: reference tool, maximum GPU operation
    2016Hive Systems: Annual publication of tables "gross force by GPU" become industrial reference

    2.2 Benchmarks

    The GPU revolution changed the order of magnitude of the raw force. On CPU, an attacker of the 1990s tested ~10,000 MD5/second passwords. A RTX 5090 in 2025 in test 219.5 billion per second — an acceleration of 22 million times in 30 years.

    Key academic sources :

    3. Math bases: keyspace and entropy

    3.1 Keyspace

    Keyspace (keyspace) is the total number of possible passwords for a given length and tank:

    keyspace = charset_size ^ length

    Examples:

    CharsetSizeLengthKeyspaceOrder of magnitude
    Digits only10810⁸ = 100,000,000~10⁸
    Lowercase only26826⁸ ≈ 2.1 × 10¹¹~2 × 10¹¹
    Alphanumeric62862⁸ ≈ 2.2 × 10¹⁴~2 × 10¹⁴
    Full ASCII95895⁸ ≈ 6.6 × 10¹⁵~7 × 10¹⁵
    Full ASCII951295¹² ≈ 5.4 × 10²³~5 × 10²³
    Full ASCII951695¹⁶ ≈ 4.4 × 10³¹~4 × 10³¹

    3.2 binary entropy

    Entropy (measured in bits) is the logarithmic formulation of keyspace:

    entropie = length × log₂(charset_size)

    In Time2Crack (function entropy()) :

    function entropy(pw) {
      return pw.length * Math.log2(getCharset(pw).size);
    }

    The relationship between entropy and keyspace:

    keyspace = 2^entropie
    entropie = log₂(keyspace)
    Concrete examples :
    PasswordCharsetLengthEntropyKeyspace
    1234567810 (digits)826.6 bits10⁸
    password26 (lowercase)837.6 bits26⁸
    Password162 (alphanumeric)953.6 bits62⁹
    P@ssw0rd!95 (full ASCII)959.1 bits95⁹
    xQz7@mK9#2pL95 (full ASCII)1279 bits95¹²

    3.3 Mathematical Hope: Keyspace / 2

    Crude force does not always test keyspace Integer combinations — on average, it finds the password midway, as the target is equiprobably distributed in space.mathematical expectation the number of attempts is therefore:

    tentatives_attendues = keyspace / 2

    This is exactly what models bruteTime() in Time2Crack:

    // "For brute force: expected value is keyspace/2 (uniform random search)"
    function bruteTime(keyspace, rate) {
      const ls = Math.log(keyspace / 2) - Math.log(rate);
      return Math.exp(ls); // = (keyspace / 2) / rate
    }

    This division by 2 is correct under the assumption that the attacker travels the space linearly (non-repetitive). keyspace/2 Attempts.


    4. Effective defences

    14.1 User side: length and randomity

    Gross force is defeated by two combined factors:

    Length : each additional character multiplies the keyspace by charset_sizeFrom 8 to 12 characters (charset 95) multiplies the keyspace by 954 - 81 million.
    True random : a cryptographically secure generator (CSPRNG) produces passwords that do not benefit from any probabilistic reduction. Markov, PCFG and Neural have no advantage over a really random password.
    Practical recommendation :

    14.2 Server side: resistant algorithms

    The choice of the hash algorithm multiplies or divides the raw force time by factors up to several million :

    RecommendationAlgorithmReason
    RecommendedArgon2idMemory-hard, GPU resistant
    Recommendedbcrypt (cost ≥ 12)Intentionally slow, salty
    AcceptablescryptMemory-hard but less standardized
    InadequateSHA-256 saltedToo fast even with salt
    DangerousMD5, SHA-1, NTLMNon salty, extremely fast

    5. Bibliographic references

    Academics

    Morris, R., & Thompson, K. (1979). Password security: A case history. Communications of the ACM, 22(11), 594–597. → Founding article on Unix password security
    Sprengers, M. (2011). GPU-based password tracking (Master's theses). Radboud University Nijmegen. → Mathematical formalization of GPU cracking, benchmarks on single GPU
    Wheeler, D.L. (2016). zxcvbn: Low-Budget Password Strength Estimate. 25th USENIX Security Symposium. → Data on effective keyspace (Table 2: -30% for structured passwords)
    Dürmuth, M. et al. (2015). OMEN: Ordered Markov ENumerator. ESORICS 2015. → Comparative reference for probabilistic terminals vs gross force

    Industry

    Hive Systems. (2025). 2025 Hive Systems Password Table. https://www.hivesystems.io/password-table → Annual benchmarks on 12× RTX 5090, standard reference
    Gosney, J (2012). 8x Nvidia GTX 1080 Hashcat benchmarks. GitHub Gist. → First public multi-GPU benchmark, historical reference
    Hashcat. (2024). Official Hashcat benchmarks v6.2.6. https://hashcat.net/hashcat/ → Official speeds by algorithm, source of Time2Crack constants
    NIST SP 800-63B. (2017, updated 2024). Digital Identity Guidelines: Authentication and Lifecycle Management. → Official recommendations on password length and complexity
    OWASP. (2024). Password Storage Cheat Sheet. https://cheatssheetseries.owasp.org/cheatssheets/Password Storage Cheat Sheet.html → Recommendations on bcrypt (cost ≥ 12), Argon2id as modern standards
    Document generated for Time2Crack project — last update : 2026-04-18 Based on implementation in app.js, raw functionsTime(), getCharset(), and monotonicity guard