Debian Codegraph @

hash/siphash/+test.ha

raw
1 // SPDX-License-Identifier: MPL-2.0
2 // (c) Hare authors <https://harelang.org>
3
4 use endian;
5 use hash;
6 use strings;
7
8 @test fn siphash() void = {
9 // same data and test procedure as the reference implementation
10 const vectors: [64]u64 = [
11 0x726fdb47dd0e0e31, 0x74f839c593dc67fd,
12 0x0d6c8009d9a94f5a, 0x85676696d7fb7e2d,
13 0xcf2794e0277187b7, 0x18765564cd99a68d,
14 0xcbc9466e58fee3ce, 0xab0200f58b01d137,
15 0x93f5f5799a932462, 0x9e0082df0ba9e4b0,
16 0x7a5dbbc594ddb9f3, 0xf4b32f46226bada7,
17 0x751e8fbc860ee5fb, 0x14ea5627c0843d90,
18 0xf723ca908e7af2ee, 0xa129ca6149be45e5,
19 0x3f2acc7f57c29bdb, 0x699ae9f52cbe4794,
20 0x4bc1b3f0968dd39c, 0xbb6dc91da77961bd,
21 0xbed65cf21aa2ee98, 0xd0f2cbb02e3b67c7,
22 0x93536795e3a33e88, 0xa80c038ccd5ccec8,
23 0xb8ad50c6f649af94, 0xbce192de8a85b8ea,
24 0x17d835b85bbb15f3, 0x2f2e6163076bcfad,
25 0xde4daaaca71dc9a5, 0xa6a2506687956571,
26 0xad87a3535c49ef28, 0x32d892fad841c342,
27 0x7127512f72f27cce, 0xa7f32346f95978e3,
28 0x12e0b01abb051238, 0x15e034d40fa197ae,
29 0x314dffbe0815a3b4, 0x027990f029623981,
30 0xcadcd4e59ef40c4d, 0x9abfd8766a33735c,
31 0x0e3ea96b5304a7d0, 0xad0c42d6fc585992,
32 0x187306c89bc215a9, 0xd4a60abcf3792b95,
33 0xf935451de4f21df2, 0xa9538f0419755787,
34 0xdb9acddff56ca510, 0xd06c98cd5c0975eb,
35 0xe612a3cb9ecba951, 0xc766e62cfcadaf96,
36 0xee64435a9752fe72, 0xa192d576b245165a,
37 0x0a8787bf8ecb74b2, 0x81b3e73d20b49b6f,
38 0x7fa8220ba3b2ecea, 0x245731c13ca42499,
39 0xb78dbfaf3a8d83bd, 0xea1ad565322a1a0b,
40 0x60e61c23a3795013, 0x6606d7e446282b93,
41 0x6ca4ecb15c5f91e1, 0x9f626da15c9625f3,
42 0xe51b38608ef25f57, 0x958a324ceb064572,
43 ];
44
45 let key: [16]u8 = [0...];
46 for (let i = 0u8; i < 16; i += 1) {
47 key[i] = i;
48 };
49 let sip = siphash(2, 4, &key);
50 defer hash::close(&sip);
51
52 let buf: [8]u8 = [0...];
53 for (let i = 0u8; i < 64; i += 1) {
54 hash::sum(&sip, &buf);
55 assert(endian::legetu64(buf) == vectors[i]);
56 hash::write(&sip, [i]);
57 };
58
59 const vectors: [_](str, u64) = [
60 ("", 0x726fdb47dd0e0e31),
61 ("abc", 0x5dbcfa53aa2007a5),
62 ("abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 0x62da29967a36b79f),
63 ("abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmnhijklmnoijklmnopjklmnopqklmnopqrlmnopqrsmnopqrstnopqrstu", 0x3ddf92b5dac6728b),
64 ("hello world", 0xed5159c956cd5602),
65 ("Hare is a cool language", 0xb459a8d06410857e),
66 ("'UNIX was not designed to stop its users from doing stupid things, as that would also stop them from doing clever things' - Doug Gwyn", 0x8f2787e694a9cced),
67 ("'Life is too short to run proprietary software' - Bdale Garbee", 0xfe97befe3823b15c),
68 ("'The central enemy of reliability is complexity.' - Geer et al", 0x61ea79c94e39ed29),
69 ];
70
71 for (let i = 0z; i < len(vectors); i += 1) {
72 const vector = vectors[i];
73 let sip = siphash(2, 4, &key);
74 defer hash::close(&sip);
75 hash::write(&sip, strings::toutf8(vector.0));
76 assert(sum(&sip) == vector.1);
77 };
78
79 // Uncomment this to run the 1G test vector (I promise it works):
80
81 // const input = "abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmnhijklmno";
82 // const expected = 0x439f9847c050d927u64;
83 // let sip = siphash(2, 4, &key);
84 // defer hash::close(&sip);
85 // for (let i = 0z; i < 16777216; i += 1) {
86 // hash::write(&sip, strings::toutf8(input));
87 // };
88 // assert(sum(&sip) == expected);
89 };