happy_cracking/crypto/

hashcrack.rs

use anyhow::{Context, Result};
use clap::{Subcommand, ValueEnum};
use md4::Md4;
use md5::Md5;
use rayon::prelude::*;
use sha1::Sha1;
use sha2::{Digest, Sha256, Sha512};
use std::path::PathBuf;

const MAX_BRUTE_SPACE: u128 = 1_000_000_000;

const MAX_CHARSET_LEN: usize = 256;

#[derive(Clone, Copy, ValueEnum)]
pub enum HashAlgo {
    Md5,
    Sha1,
    Sha256,
    Sha512,
    Md4,
    Ntlm,
}

impl HashAlgo {
    fn hex_len(self) -> usize {
        match self {
            HashAlgo::Md5 | HashAlgo::Md4 | HashAlgo::Ntlm => 32,
            HashAlgo::Sha1 => 40,
            HashAlgo::Sha256 => 64,
            HashAlgo::Sha512 => 128,
        }
    }
}

#[derive(Clone, Copy, ValueEnum)]
pub enum SaltPosition {
    Prefix,
    Suffix,
}

#[derive(Clone, Copy, ValueEnum)]
pub enum CharsetPreset {
    Lower,
    Upper,
    Digits,
    Alnum,
    All,
}

#[derive(Subcommand)]
pub enum HashcrackAction {
    #[command(about = "Dictionary attack against a target hash using a wordlist file")]
    Dict {
        #[arg(help = "Target hash (case-insensitive hex)")]
        hash: String,
        #[arg(short, long, help = "Wordlist file, one candidate per line")]
        wordlist: PathBuf,
        #[arg(
            short,
            long,
            value_enum,
            help = "Hash algorithm (auto-detect if omitted)"
        )]
        algo: Option<HashAlgo>,
        #[arg(short, long, help = "Salt to combine with each candidate")]
        salt: Option<String>,
        #[arg(
            long,
            value_enum,
            default_value = "suffix",
            help = "Where to place the salt relative to the candidate"
        )]
        salt_position: SaltPosition,
    },
    #[command(about = "Incremental brute-force attack against a target hash")]
    Brute {
        #[arg(help = "Target hash (case-insensitive hex)")]
        hash: String,
        #[arg(short, long, value_enum, help = "Hash algorithm")]
        algo: HashAlgo,
        #[arg(
            short,
            long,
            default_value = "abcdefghijklmnopqrstuvwxyz0123456789",
            help = "Characters to try (ignored when --preset is given)"
        )]
        charset: String,
        #[arg(
            short,
            long,
            value_enum,
            help = "Predefined charset overriding --charset"
        )]
        preset: Option<CharsetPreset>,
        #[arg(long, default_value = "1", help = "Minimum candidate length")]
        min_len: usize,
        #[arg(long, default_value = "4", help = "Maximum candidate length")]
        max_len: usize,
        #[arg(short, long, help = "Salt to combine with each candidate")]
        salt: Option<String>,
        #[arg(
            long,
            value_enum,
            default_value = "suffix",
            help = "Where to place the salt relative to the candidate"
        )]
        salt_position: SaltPosition,
    },
    #[command(about = "Reverse-lookup a hash in a precomputed table file")]
    Lookup {
        #[arg(help = "Target hash (case-insensitive hex)")]
        hash: String,
        #[arg(short, long, help = "Table file with `hash<sep>plaintext` lines")]
        table: PathBuf,
    },
    #[command(about = "Dictionary attack with hashcat-style rules applied to each word")]
    Rule {
        #[arg(help = "Target hash (case-insensitive hex)")]
        hash: String,
        #[arg(short, long, help = "Wordlist file")]
        wordlist: PathBuf,
        #[arg(
            short,
            long,
            help = "Rules file (one rule per line); if omitted, built-in rules are used"
        )]
        rules: Option<PathBuf>,
        #[arg(
            short,
            long,
            value_enum,
            help = "Hash algorithm (auto-detect if omitted)"
        )]
        algo: Option<HashAlgo>,
    },
    #[command(about = "Mask attack (?l ?u ?d ?s ?a and literals, hashcat-style)")]
    Mask {
        #[arg(help = "Target hash (case-insensitive hex)")]
        hash: String,
        #[arg(short, long, help = "Mask, e.g. '?l?l?l?d?d' or 'flag{?d?d?d}'")]
        mask: String,
        #[arg(short, long, value_enum, help = "Hash algorithm")]
        algo: HashAlgo,
    },
    #[command(about = "Hybrid attack: wordlist candidates with numeric suffixes")]
    Hybrid {
        #[arg(help = "Target hash (case-insensitive hex)")]
        hash: String,
        #[arg(short, long, help = "Wordlist file")]
        wordlist: PathBuf,
        #[arg(
            short,
            long,
            value_enum,
            help = "Hash algorithm (auto-detect if omitted)"
        )]
        algo: Option<HashAlgo>,
        #[arg(long, default_value = "0", help = "Minimum suffix digits (inclusive)")]
        min_digits: u32,
        #[arg(long, default_value = "2", help = "Maximum suffix digits (inclusive)")]
        max_digits: u32,
        #[arg(long, help = "Also try prefixes instead of only suffixes")]
        also_prefix: bool,
    },
}

pub fn run(action: HashcrackAction) -> Result<()> {
    match action {
        HashcrackAction::Dict {
            hash,
            wordlist,
            algo,
            salt,
            salt_position,
        } => run_dict(&hash, &wordlist, algo, salt.as_deref(), salt_position),
        HashcrackAction::Brute {
            hash,
            algo,
            charset,
            preset,
            min_len,
            max_len,
            salt,
            salt_position,
        } => {
            let charset = match preset {
                Some(p) => preset_charset(p).to_string(),
                None => charset,
            };
            run_brute(
                &hash,
                algo,
                &charset,
                min_len,
                max_len,
                salt.as_deref(),
                salt_position,
            )
        }
        HashcrackAction::Lookup { hash, table } => run_lookup(&hash, &table),
        HashcrackAction::Rule {
            hash,
            wordlist,
            rules,
            algo,
        } => run_rule(&hash, &wordlist, rules.as_ref(), algo),
        HashcrackAction::Mask { hash, mask, algo } => run_mask(&hash, &mask, algo),
        HashcrackAction::Hybrid {
            hash,
            wordlist,
            algo,
            min_digits,
            max_digits,
            also_prefix,
        } => run_hybrid(&hash, &wordlist, algo, min_digits, max_digits, also_prefix),
    }
}

fn run_dict(
    hash: &str,
    wordlist: &PathBuf,
    algo: Option<HashAlgo>,
    salt: Option<&str>,
    pos: SaltPosition,
) -> Result<()> {
    let target = normalize_hash(hash);
    let candidates = read_wordlist(wordlist)?;

    let algos = match algo {
        Some(a) => vec![a],
        None => algos_for_hex_len(target.len()),
    };
    if algos.is_empty() {
        anyhow::bail!(
            "Could not auto-detect an algorithm for a {}-character hash; pass --algo explicitly",
            target.len()
        );
    }

    for a in algos {
        if let Some(found) = find_in_candidates(&target, a, salt, pos, &candidates) {
            println!("Found: {}", found);
            return Ok(());
        }
    }
    println!("Not found");
    Ok(())
}

fn run_brute(
    hash: &str,
    algo: HashAlgo,
    charset: &str,
    min_len: usize,
    max_len: usize,
    salt: Option<&str>,
    pos: SaltPosition,
) -> Result<()> {
    let target = normalize_hash(hash);
    match brute_force(&target, algo, charset, min_len, max_len, salt, pos)? {
        Some(found) => println!("Found: {}", found),
        None => println!("Not found"),
    }
    Ok(())
}

fn run_lookup(hash: &str, table: &PathBuf) -> Result<()> {
    let target = normalize_hash(hash);
    match lookup_in_table_file(&target, table)? {
        Some(plain) => println!("Found: {}", plain),
        None => println!("Not found"),
    }
    Ok(())
}

pub fn compute_hash(algo: HashAlgo, input: &str) -> String {
    match algo {
        HashAlgo::Md5 => {
            let mut hasher = Md5::new();
            hasher.update(input.as_bytes());
            hex::encode(hasher.finalize())
        }
        HashAlgo::Sha1 => {
            let mut hasher = Sha1::new();
            hasher.update(input.as_bytes());
            hex::encode(hasher.finalize())
        }
        HashAlgo::Sha256 => {
            let mut hasher = Sha256::new();
            hasher.update(input.as_bytes());
            hex::encode(hasher.finalize())
        }
        HashAlgo::Sha512 => {
            let mut hasher = Sha512::new();
            hasher.update(input.as_bytes());
            hex::encode(hasher.finalize())
        }
        HashAlgo::Md4 => {
            let mut hasher = Md4::new();
            hasher.update(input.as_bytes());
            hex::encode(hasher.finalize())
        }
        HashAlgo::Ntlm => {
            let mut hasher = Md4::new();
            for unit in input.encode_utf16() {
                hasher.update(unit.to_le_bytes());
            }
            hex::encode(hasher.finalize())
        }
    }
}

fn apply_salt(word: &str, salt: Option<&str>, pos: SaltPosition) -> String {
    match salt {
        None => word.to_string(),
        Some(s) => match pos {
            SaltPosition::Prefix => format!("{}{}", s, word),
            SaltPosition::Suffix => format!("{}{}", word, s),
        },
    }
}

fn normalize_hash(hash: &str) -> String {
    hash.trim().to_ascii_lowercase()
}

fn algos_for_hex_len(hex_len: usize) -> Vec<HashAlgo> {
    [
        HashAlgo::Md5,
        HashAlgo::Md4,
        HashAlgo::Ntlm,
        HashAlgo::Sha1,
        HashAlgo::Sha256,
        HashAlgo::Sha512,
    ]
    .into_iter()
    .filter(|a| a.hex_len() == hex_len)
    .collect()
}

fn preset_charset(preset: CharsetPreset) -> &'static str {
    match preset {
        CharsetPreset::Lower => "abcdefghijklmnopqrstuvwxyz",
        CharsetPreset::Upper => "ABCDEFGHIJKLMNOPQRSTUVWXYZ",
        CharsetPreset::Digits => "0123456789",
        CharsetPreset::Alnum => "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789",
        CharsetPreset::All => {
            "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789 !\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~"
        }
    }
}

fn read_wordlist(path: &PathBuf) -> Result<Vec<String>> {
    let bytes = std::fs::read(path)
        .with_context(|| format!("Failed to read wordlist: {}", path.display()))?;
    Ok(bytes
        .split(|&b| b == b'\n')
        .map(|line| {
            let line = line.strip_suffix(b"\r").unwrap_or(line);
            String::from_utf8_lossy(line).into_owned()
        })
        .filter(|line| !line.is_empty())
        .collect())
}

pub fn find_in_candidates(
    target: &str,
    algo: HashAlgo,
    salt: Option<&str>,
    pos: SaltPosition,
    candidates: &[String],
) -> Option<String> {
    let target = normalize_hash(target);
    candidates.par_iter().find_map_any(|word| {
        let salted = apply_salt(word, salt, pos);
        if compute_hash(algo, &salted) == target {
            Some(word.clone())
        } else {
            None
        }
    })
}

pub fn brute_force(
    target: &str,
    algo: HashAlgo,
    charset: &str,
    min_len: usize,
    max_len: usize,
    salt: Option<&str>,
    pos: SaltPosition,
) -> Result<Option<String>> {
    let target = normalize_hash(target);
    let chars: Vec<char> = charset.chars().collect();
    if chars.is_empty() {
        anyhow::bail!("Charset must not be empty");
    }
    if chars.len() > MAX_CHARSET_LEN {
        anyhow::bail!(
            "Charset too large ({} characters); maximum is {}",
            chars.len(),
            MAX_CHARSET_LEN
        );
    }
    if min_len == 0 {
        anyhow::bail!("--min-len must be at least 1");
    }
    if max_len < min_len {
        anyhow::bail!("--max-len ({}) must be >= --min-len ({})", max_len, min_len);
    }

    let base = chars.len() as u128;
    let mut total: u128 = 0;
    for len in min_len..=max_len {
        let count = base
            .checked_pow(len as u32)
            .context("Brute-force search space overflowed")?;
        total = total
            .checked_add(count)
            .context("Brute-force search space overflowed")?;
        if total > MAX_BRUTE_SPACE {
            anyhow::bail!(
                "Search space exceeds the limit of {} candidates; narrow the charset or length range",
                MAX_BRUTE_SPACE
            );
        }
    }

    for len in min_len..=max_len {
        let count = base.pow(len as u32);
        if let Some(found) = (0..count).into_par_iter().find_map_any(|index| {
            let word = index_to_word(index, &chars, len);
            let salted = apply_salt(&word, salt, pos);
            if compute_hash(algo, &salted) == target {
                Some(word)
            } else {
                None
            }
        }) {
            return Ok(Some(found));
        }
    }
    Ok(None)
}

fn index_to_word(index: u128, chars: &[char], len: usize) -> String {
    let base = chars.len() as u128;
    let mut digits = vec![chars[0]; len];
    let mut remaining = index;
    for slot in digits.iter_mut().rev() {
        *slot = chars[(remaining % base) as usize];
        remaining /= base;
    }
    digits.into_iter().collect()
}

pub fn lookup_in_pairs<'a, I, S>(target: &str, pairs: I) -> Option<String>
where
    I: IntoIterator<Item = (S, S)>,
    S: AsRef<str> + 'a,
{
    let target = normalize_hash(target);
    for (hash, plain) in pairs {
        if normalize_hash(hash.as_ref()) == target {
            return Some(plain.as_ref().to_string());
        }
    }
    None
}

pub fn parse_table_line(line: &str) -> Option<(String, String)> {
    let line = line.trim();
    if line.is_empty() {
        return None;
    }
    let (hash, plain) = if let Some((h, p)) = line.split_once(':') {
        (h, p)
    } else {
        line.split_once(char::is_whitespace)?
    };
    let hash = hash.trim();
    let plain = plain.trim();
    if hash.is_empty() {
        return None;
    }
    Some((hash.to_string(), plain.to_string()))
}

fn lookup_in_table_file(target: &str, path: &PathBuf) -> Result<Option<String>> {
    use std::io::BufRead;
    let file = std::fs::File::open(path)
        .with_context(|| format!("Failed to open table: {}", path.display()))?;
    let target = normalize_hash(target);
    let reader = std::io::BufReader::new(file);
    for line in reader.lines() {
        let line = line.context("Failed to read table line")?;
        if let Some((hash, plain)) = parse_table_line(&line)
            && normalize_hash(&hash) == target
        {
            return Ok(Some(plain));
        }
    }
    Ok(None)
}

const BUILTIN_RULES: &[&str] = &[
    ":", // identity
    "l", // lowercase
    "u", // uppercase
    "c", // capitalize
    "r", // reverse
    "d", // duplicate
    "$1",
    "$2",
    "$!",
    "$1$2$3",
    "^!",
    "c$1",
    "c$!",
    "u$1",
    "l$1",
    "l$2$0$2$4",
];

fn run_rule(
    hash: &str,
    wordlist: &PathBuf,
    rules_path: Option<&PathBuf>,
    algo: Option<HashAlgo>,
) -> Result<()> {
    let target = normalize_hash(hash);
    let words = read_wordlist(wordlist)?;
    let rules: Vec<String> = if let Some(path) = rules_path {
        read_wordlist(path)?
    } else {
        BUILTIN_RULES.iter().map(|s| (*s).to_string()).collect()
    };
    let algos = match algo {
        Some(a) => vec![a],
        None => algos_for_hex_len(target.len()),
    };
    if algos.is_empty() {
        anyhow::bail!(
            "Could not auto-detect an algorithm for a {}-character hash; pass --algo explicitly",
            target.len()
        );
    }

    for a in algos {
        if let Some(found) = rule_attack(&target, a, &words, &rules) {
            println!("Found: {}", found);
            return Ok(());
        }
    }
    println!("Not found");
    Ok(())
}

fn run_mask(hash: &str, mask: &str, algo: HashAlgo) -> Result<()> {
    let target = normalize_hash(hash);
    match mask_attack(&target, algo, mask)? {
        Some(found) => println!("Found: {}", found),
        None => println!("Not found"),
    }
    Ok(())
}

fn run_hybrid(
    hash: &str,
    wordlist: &PathBuf,
    algo: Option<HashAlgo>,
    min_digits: u32,
    max_digits: u32,
    also_prefix: bool,
) -> Result<()> {
    let target = normalize_hash(hash);
    let words = read_wordlist(wordlist)?;
    let algos = match algo {
        Some(a) => vec![a],
        None => algos_for_hex_len(target.len()),
    };
    if algos.is_empty() {
        anyhow::bail!(
            "Could not auto-detect an algorithm for a {}-character hash; pass --algo explicitly",
            target.len()
        );
    }
    for a in algos {
        if let Some(found) = hybrid_attack(&target, a, &words, min_digits, max_digits, also_prefix)?
        {
            println!("Found: {}", found);
            return Ok(());
        }
    }
    println!("Not found");
    Ok(())
}

/// Apply a minimal hashcat-like rule to a word.
/// Supported: `:` identity, `l` lower, `u` upper, `c` capitalize, `t` toggle,
/// `r` reverse, `d` duplicate, `$X` append, `^X` prepend.
pub fn apply_rule(word: &str, rule: &str) -> String {
    let mut out = word.to_string();
    let chars: Vec<char> = rule.chars().collect();
    let mut i = 0usize;
    while i < chars.len() {
        match chars[i] {
            ':' => {}
            'l' => out = out.to_ascii_lowercase(),
            'u' => out = out.to_ascii_uppercase(),
            'c' => {
                let mut cs: Vec<char> = out.chars().collect();
                if let Some(first) = cs.first_mut() {
                    *first = first.to_ascii_uppercase();
                }
                for ch in cs.iter_mut().skip(1) {
                    *ch = ch.to_ascii_lowercase();
                }
                out = cs.into_iter().collect();
            }
            't' => {
                out = out
                    .chars()
                    .map(|c| {
                        if c.is_ascii_uppercase() {
                            c.to_ascii_lowercase()
                        } else {
                            c.to_ascii_uppercase()
                        }
                    })
                    .collect();
            }
            'r' => out = out.chars().rev().collect(),
            'd' => out = format!("{}{}", out, out),
            '$' => {
                i += 1;
                if i < chars.len() {
                    out.push(chars[i]);
                }
            }
            '^' => {
                i += 1;
                if i < chars.len() {
                    out.insert(0, chars[i]);
                }
            }
            _ => {
                // Unknown rule atom: ignore
            }
        }
        i += 1;
    }
    out
}

pub fn rule_attack(
    target: &str,
    algo: HashAlgo,
    words: &[String],
    rules: &[String],
) -> Option<String> {
    let target = normalize_hash(target);
    let rules: Vec<&str> = rules.iter().map(|s| s.as_str()).collect();
    words.par_iter().find_map_any(|word| {
        for rule in &rules {
            let candidate = apply_rule(word, rule);
            if compute_hash(algo, &candidate) == target {
                return Some(candidate);
            }
        }
        None
    })
}

/// Expand a mask into character class choices per position.
/// `?l` lower, `?u` upper, `?d` digits, `?s` special, `?a` all printable ascii,
/// `?h` hex lower, `??` literal `?`, otherwise literal char.
pub fn expand_mask(mask: &str) -> Result<Vec<Vec<char>>> {
    let chars: Vec<char> = mask.chars().collect();
    let mut positions: Vec<Vec<char>> = Vec::new();
    let mut i = 0usize;
    while i < chars.len() {
        if chars[i] == '?' {
            i += 1;
            if i >= chars.len() {
                anyhow::bail!("Mask ends with dangling '?'");
            }
            let class = match chars[i] {
                'l' => "abcdefghijklmnopqrstuvwxyz".chars().collect(),
                'u' => "ABCDEFGHIJKLMNOPQRSTUVWXYZ".chars().collect(),
                'd' => "0123456789".chars().collect(),
                's' => " !\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~".chars().collect(),
                'a' => (0x20u8..=0x7eu8).map(|b| b as char).collect(),
                'h' => "0123456789abcdef".chars().collect(),
                '?' => vec!['?'],
                other => anyhow::bail!("Unknown mask class '?{}'", other),
            };
            positions.push(class);
        } else {
            positions.push(vec![chars[i]]);
        }
        i += 1;
    }
    if positions.is_empty() {
        anyhow::bail!("Mask is empty");
    }
    Ok(positions)
}

pub fn mask_attack(target: &str, algo: HashAlgo, mask: &str) -> Result<Option<String>> {
    let target = normalize_hash(target);
    let positions = expand_mask(mask)?;
    let mut total: u128 = 1;
    for pos in &positions {
        total = total
            .checked_mul(pos.len() as u128)
            .context("Mask search space overflowed")?;
        if total > MAX_BRUTE_SPACE {
            anyhow::bail!(
                "Mask search space exceeds the limit of {} candidates",
                MAX_BRUTE_SPACE
            );
        }
    }

    let bases: Vec<u128> = positions.iter().map(|p| p.len() as u128).collect();
    let found = (0..total).into_par_iter().find_map_any(|index| {
        let mut rem = index;
        let mut word = String::with_capacity(positions.len());
        // Most-significant position first
        let mut digits = vec![0u128; positions.len()];
        for i in (0..positions.len()).rev() {
            digits[i] = rem % bases[i];
            rem /= bases[i];
        }
        for (i, d) in digits.iter().enumerate() {
            word.push(positions[i][*d as usize]);
        }
        if compute_hash(algo, &word) == target {
            Some(word)
        } else {
            None
        }
    });
    Ok(found)
}

pub fn hybrid_attack(
    target: &str,
    algo: HashAlgo,
    words: &[String],
    min_digits: u32,
    max_digits: u32,
    also_prefix: bool,
) -> Result<Option<String>> {
    if max_digits > 6 {
        anyhow::bail!("--max-digits must be <= 6 (got {})", max_digits);
    }
    if min_digits > max_digits {
        anyhow::bail!("--min-digits must be <= --max-digits");
    }
    let target = normalize_hash(target);

    // Estimate space
    let mut total: u128 = 0;
    for d in min_digits..=max_digits {
        let count = 10u128.pow(d);
        let variants = if also_prefix { 2u128 } else { 1u128 };
        // include bare word once when d range covers 0
        total = total
            .checked_add(
                (words.len() as u128)
                    .checked_mul(count)
                    .and_then(|v| v.checked_mul(variants))
                    .context("Hybrid search space overflowed")?,
            )
            .context("Hybrid search space overflowed")?;
        if total > MAX_BRUTE_SPACE {
            anyhow::bail!(
                "Hybrid search space exceeds the limit of {} candidates",
                MAX_BRUTE_SPACE
            );
        }
    }

    let found = words.par_iter().find_map_any(|word| {
        for digits in min_digits..=max_digits {
            let max_n = 10u32.pow(digits);
            for n in 0..max_n {
                let suffix = if digits == 0 {
                    String::new()
                } else {
                    format!("{:0width$}", n, width = digits as usize)
                };
                let candidate = format!("{}{}", word, suffix);
                if compute_hash(algo, &candidate) == target {
                    return Some(candidate);
                }
                if also_prefix && digits > 0 {
                    let candidate = format!("{}{}", suffix, word);
                    if compute_hash(algo, &candidate) == target {
                        return Some(candidate);
                    }
                }
            }
        }
        None
    });
    Ok(found)
}

/// Built-in mutations used by rule mode (exported for tests).
pub fn builtin_rules() -> Vec<&'static str> {
    BUILTIN_RULES.to_vec()
}