happy-cracking 0.5.0

A fast, comprehensive CTF toolkit for cryptographic encoding/decoding, classic ciphers, hash operations, and analysis tools
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145

use happy_cracking::crypto::primes;

#[test]
fn test_factorize_prime() {
    assert_eq!(primes::factorize(7), vec![(7, 1)]);
}

#[test]
fn test_factorize_composite() {
    // 12 = 2^2 * 3
    assert_eq!(primes::factorize(12), vec![(2, 2), (3, 1)]);
}

#[test]
fn test_factorize_power_of_two() {
    assert_eq!(primes::factorize(64), vec![(2, 6)]);
}

#[test]
fn test_factorize_large() {
    // 2310 = 2 * 3 * 5 * 7 * 11
    assert_eq!(
        primes::factorize(2310),
        vec![(2, 1), (3, 1), (5, 1), (7, 1), (11, 1)]
    );
}

#[test]
fn test_factorize_one() {
    assert_eq!(primes::factorize(1), vec![]);
}

#[test]
fn test_factorize_zero() {
    assert_eq!(primes::factorize(0), vec![]);
}

#[test]
fn test_factorize_two() {
    assert_eq!(primes::factorize(2), vec![(2, 1)]);
}

#[test]
fn test_is_prime_small() {
    assert!(!primes::is_prime(0));
    assert!(!primes::is_prime(1));
    assert!(primes::is_prime(2));
    assert!(primes::is_prime(3));
    assert!(!primes::is_prime(4));
    assert!(primes::is_prime(5));
}

#[test]
fn test_is_prime_known() {
    assert!(primes::is_prime(97));
    assert!(primes::is_prime(101));
    assert!(primes::is_prime(7919));
}

#[test]
fn test_is_prime_composite() {
    assert!(!primes::is_prime(100));
    assert!(!primes::is_prime(1000));
    assert!(!primes::is_prime(9));
}

#[test]
fn test_format_factors_single() {
    assert_eq!(primes::format_factors(&[(7, 1)]), "7");
}

#[test]
fn test_format_factors_with_exponents() {
    assert_eq!(
        primes::format_factors(&[(2, 2), (3, 1), (7, 1)]),
        "2^2 × 3 × 7"
    );
}

#[test]
fn test_format_factors_empty() {
    assert_eq!(primes::format_factors(&[]), "1");
}

#[test]
fn test_factorize_roundtrip() {
    let n = 360_u128; // 2^3 * 3^2 * 5
    let factors = primes::factorize(n);
    let product: u128 = factors.iter().map(|(p, e)| p.pow(*e)).product();
    assert_eq!(product, n);
}

#[test]
fn test_is_prime_large_performance() {
    use std::time::Instant;

    // 64-bit prime: 2^64 - 59
    let large_prime = 18446744073709551557;
    let start = Instant::now();
    let result = primes::is_prime(large_prime);
    let duration = start.elapsed();
    assert!(result);
    assert!(
        duration.as_millis() < 50,
        "Miller-Rabin should be very fast for u64"
    );

    // 128-bit prime: 2^127 - 1 (Mersenne prime)
    let larger_prime: u128 = 170141183460469231731687303715884105727;
    let start = Instant::now();
    let result = primes::is_prime(larger_prime);
    let duration = start.elapsed();
    assert!(result);
    assert!(
        duration.as_millis() < 50,
        "Miller-Rabin should be very fast for u128"
    );
}

#[test]
fn test_factorize_large_prime_performance() {
    use std::time::Instant;

    // 64-bit prime should be instant
    let large_prime = 18446744073709551557;
    let start = Instant::now();
    let factors = primes::factorize(large_prime);
    let duration = start.elapsed();
    assert_eq!(factors, vec![(large_prime, 1)]);
    assert!(
        duration.as_millis() < 50,
        "Factorize for prime should be instant"
    );

    // 128-bit prime should be instant
    let larger_prime: u128 = 170141183460469231731687303715884105727;
    let start = Instant::now();
    let factors = primes::factorize(larger_prime);
    let duration = start.elapsed();
    assert_eq!(factors, vec![(larger_prime, 1)]);
    assert!(
        duration.as_millis() < 50,
        "Factorize for large prime should be instant"
    );
}