]>
Commit | Line | Data |
---|---|---|
53e1b683 | 1 | /* SPDX-License-Identifier: LGPL-2.1+ */ |
a245d90a | 2 | /*** |
96b2fb93 | 3 | Copyright © 2015 Tom Gundersen |
a245d90a TG |
4 | ***/ |
5 | ||
a245d90a | 6 | #include "siphash24.h" |
cf0fbc49 | 7 | #include "util.h" |
a245d90a TG |
8 | |
9 | #define ITERATIONS 10000000ULL | |
10 | ||
56e3d0cf | 11 | static void do_test(const uint8_t *in, size_t len, const uint8_t *key) { |
1283d704 | 12 | struct siphash state = {}; |
56e3d0cf | 13 | uint64_t out; |
0cb3c286 | 14 | unsigned i, j; |
a245d90a | 15 | |
933f9cae | 16 | out = siphash24(in, len, key); |
81d313a6 | 17 | assert_se(out == 0xa129ca6149be45e5); |
1283d704 TG |
18 | |
19 | /* verify the internal state as given in the above paper */ | |
0cb3c286 | 20 | siphash24_init(&state, key); |
1283d704 TG |
21 | assert_se(state.v0 == 0x7469686173716475); |
22 | assert_se(state.v1 == 0x6b617f6d656e6665); | |
23 | assert_se(state.v2 == 0x6b7f62616d677361); | |
24 | assert_se(state.v3 == 0x7b6b696e727e6c7b); | |
69b98e71 | 25 | siphash24_compress(in, len, &state); |
1283d704 TG |
26 | assert_se(state.v0 == 0x4a017198de0a59e0); |
27 | assert_se(state.v1 == 0x0d52f6f62a4f59a4); | |
28 | assert_se(state.v2 == 0x634cb3577b01fd3d); | |
29 | assert_se(state.v3 == 0xa5224d6f55c7d9c8); | |
933f9cae | 30 | out = siphash24_finalize(&state); |
81d313a6 | 31 | assert_se(out == 0xa129ca6149be45e5); |
1283d704 TG |
32 | assert_se(state.v0 == 0xf6bcd53893fecff1); |
33 | assert_se(state.v1 == 0x54b9964c7ea0d937); | |
34 | assert_se(state.v2 == 0x1b38329c099bb55a); | |
35 | assert_se(state.v3 == 0x1814bb89ad7be679); | |
36 | ||
37 | /* verify that decomposing the input in three chunks gives the | |
38 | same result */ | |
69b98e71 MP |
39 | for (i = 0; i < len; i++) { |
40 | for (j = i; j < len; j++) { | |
0cb3c286 | 41 | siphash24_init(&state, key); |
1283d704 TG |
42 | siphash24_compress(in, i, &state); |
43 | siphash24_compress(&in[i], j - i, &state); | |
69b98e71 | 44 | siphash24_compress(&in[j], len - j, &state); |
933f9cae | 45 | out = siphash24_finalize(&state); |
81d313a6 | 46 | assert_se(out == 0xa129ca6149be45e5); |
1283d704 TG |
47 | } |
48 | } | |
56e3d0cf ZJS |
49 | } |
50 | ||
51 | static void test_short_hashes(void) { | |
52 | const uint8_t one[] = { 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, | |
53 | 0x09, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16 }; | |
54 | const uint8_t key[16] = { 0x22, 0x24, 0x41, 0x22, 0x55, 0x77, 0x88, 0x07, | |
55 | 0x23, 0x09, 0x23, 0x14, 0x0c, 0x33, 0x0e, 0x0f}; | |
56 | uint8_t two[sizeof one] = {}; | |
57 | ||
58 | struct siphash state1 = {}, state2 = {}; | |
59 | unsigned i, j; | |
60 | ||
61 | siphash24_init(&state1, key); | |
62 | siphash24_init(&state2, key); | |
63 | ||
64 | /* hashing 1, 2, 3, 4, 5, ..., 16 bytes, with the byte after the buffer different */ | |
65 | for (i = 1; i <= sizeof one; i++) { | |
66 | siphash24_compress(one, i, &state1); | |
67 | ||
68 | two[i-1] = one[i-1]; | |
69 | siphash24_compress(two, i, &state2); | |
70 | ||
71 | assert_se(memcmp(&state1, &state2, sizeof state1) == 0); | |
72 | } | |
73 | ||
74 | /* hashing n and 1, n and 2, n and 3, ..., n-1 and 1, n-2 and 2, ... */ | |
75 | for (i = sizeof one; i > 0; i--) { | |
76 | zero(two); | |
77 | ||
78 | for (j = 1; j <= sizeof one; j++) { | |
79 | siphash24_compress(one, i, &state1); | |
80 | siphash24_compress(one, j, &state1); | |
81 | ||
82 | siphash24_compress(one, i, &state2); | |
83 | two[j-1] = one[j-1]; | |
84 | siphash24_compress(two, j, &state2); | |
85 | ||
86 | assert_se(memcmp(&state1, &state2, sizeof state1) == 0); | |
87 | } | |
88 | } | |
69b98e71 MP |
89 | } |
90 | ||
91 | /* see https://131002.net/siphash/siphash.pdf, Appendix A */ | |
92 | int main(int argc, char *argv[]) { | |
93 | const uint8_t in[15] = { 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, | |
94 | 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e }; | |
95 | const uint8_t key[16] = { 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, | |
96 | 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f}; | |
97 | uint8_t in_buf[20]; | |
98 | ||
99 | /* Test with same input but different alignments. */ | |
100 | memcpy(in_buf, in, sizeof(in)); | |
101 | do_test(in_buf, sizeof(in), key); | |
102 | memcpy(in_buf + 1, in, sizeof(in)); | |
103 | do_test(in_buf + 1, sizeof(in), key); | |
104 | memcpy(in_buf + 2, in, sizeof(in)); | |
105 | do_test(in_buf + 2, sizeof(in), key); | |
106 | memcpy(in_buf + 4, in, sizeof(in)); | |
107 | do_test(in_buf + 4, sizeof(in), key); | |
56e3d0cf ZJS |
108 | |
109 | test_short_hashes(); | |
a245d90a | 110 | } |