gimli-hash 0.2.0

The Gimli-permutation based Hash
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

use gimli_hash::GimliHash;


#[cfg_attr(feature = "cargo-clippy", allow(string_lit_as_bytes))]
#[test]
fn test_hash() {
    macro_rules! test {
        ( @ $input:expr, $output:expr ) => {
            let mut output = [0; 32];
            let mut hasher = GimliHash::default();
            hasher.update($input.as_bytes());
            hasher.finalize(&mut output);
            assert_eq!(hex::decode($output).unwrap(), output, "{}", $input);
        };
        ( $( $input:expr => $output:expr ),* ) => {
            $(
                test!(@ $input, $output);
            )*
        };
    }

    test!{
        "There's plenty for the both of us, may the best Dwarf win."
            => "4afb3ff784c7ad6943d49cf5da79facfa7c4434e1ce44f5dd4b28f91a84d22c8",
        "If anyone was to ask for my opinion, which I note they're not, I'd say we were taking the long way around."
            => "ba82a16a7b224c15bed8e8bdc88903a4006bc7beda78297d96029203ef08e07c",
        "Speak words we can all understand!"
            => "8dd4d132059b72f8e8493f9afb86c6d86263e7439fc64cbb361fcbccf8b01267",
        "It's true you don't see many Dwarf-women. And in fact, they are so alike in voice and appearance, that they are often mistaken for Dwarf-men.  And this in turn has given rise to the belief that there are no Dwarf-women, and that Dwarves just spring out of holes in the ground! Which is, of course, ridiculous."
            => "ebe9bfc05ce15c73336fc3c5b52b01f75cf619bb37f13bfc7f567f9d5603191a",
        ""
            => "b0634b2c0b082aedc5c0a2fe4ee3adcfc989ec05de6f00addb04b3aaac271f67"
    };
}

#[test]
fn test_xof() {
    for i in 10..30 {
        let input = (100..).take(i).collect::<Vec<_>>();
        let mut output1 = vec![0; i];
        let mut output2 = vec![0; i];

        let mut hasher = GimliHash::default();
        hasher.update(&input);
        hasher.finalize(&mut output1);

        {
            let mut hasher = GimliHash::default();
            let (r, l) = input.split_at(i / 2 - 1);
            hasher.update(r);
            hasher.update(l);
            let (r, l) = output2.split_at_mut(i / 2 - 1);
            let mut xof = hasher.xof();
            xof.squeeze(r);
            xof.squeeze(l);
        }

        assert_eq!(output1, output2);
    }
}