tlsh2 1.1.0

A rust implementation of the TLSH algorithm
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

pub fn check(bytes: &[u8], expected_hash: &[u8]) {
    // Test single update
    let mut tlsh = tlsh2::TlshDefaultBuilder::new();
    tlsh.update(bytes);
    assert_eq!(
        tlsh.build().map(|v| v.hash().to_vec()).unwrap_or_default(),
        expected_hash
    );

    // Test by groups of 3 bytes
    let mut tlsh = tlsh2::TlshDefaultBuilder::new();
    for chunk in bytes.chunks(3) {
        tlsh.update(chunk);
    }
    assert_eq!(
        tlsh.build().map(|v| v.hash().to_vec()).unwrap_or_default(),
        expected_hash
    );
}

fn times(bytes: &[u8], times: u32) -> Vec<u8> {
    let mut res = Vec::new();

    for _ in 0..times {
        res.extend(bytes);
    }
    res
}

// Test that a long payload does not trigger overflows.
//
// This tests that the `l_capturing` helper works properly when the search is in the second half of
// the array.
#[test]
fn test_regression_1() {
    // 64B
    let str1 = b"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do ";

    // 1MB
    check(
        &times(str1, 16384),
        b"T1CE25220E008F0BC28F03003F3EEBC0AEE00820A0AB2080220CF2C02C8002208C002802",
    );

    // 5MB
    check(
        &times(str1, 16384 * 5),
        b"T15136220E008F0BC28F03003F3EEBC0AEE00820A0AB2080220CF2C02C8002208C002802",
    );

    // 10MB
    check(
        &times(str1, 16384 * 10),
        b"T146B6220E008F0BC28F03003F3EEBC0AEE00820A0AB2080220CF2C02C8002208C002802",
    );
}