1*91f7d55fSchristos /*
2*91f7d55fSchristos SipHash reference C implementation
3*91f7d55fSchristos
4*91f7d55fSchristos Copyright (c) 2012-2016 Jean-Philippe Aumasson
5*91f7d55fSchristos <jeanphilippe.aumasson@gmail.com>
6*91f7d55fSchristos Copyright (c) 2012-2014 Daniel J. Bernstein <djb@cr.yp.to>
7*91f7d55fSchristos
8*91f7d55fSchristos To the extent possible under law, the author(s) have dedicated all copyright
9*91f7d55fSchristos and related and neighboring rights to this software to the public domain
10*91f7d55fSchristos worldwide. This software is distributed without any warranty.
11*91f7d55fSchristos
12*91f7d55fSchristos You should have received a copy of the CC0 Public Domain Dedication along
13*91f7d55fSchristos with
14*91f7d55fSchristos this software. If not, see
15*91f7d55fSchristos <http://creativecommons.org/publicdomain/zero/1.0/>.
16*91f7d55fSchristos */
17*91f7d55fSchristos /**
18*91f7d55fSchristos * Edited slightly for integration in Unbound. Edits are noted with 'EDIT'.
19*91f7d55fSchristos */
20*91f7d55fSchristos /** EDIT
21*91f7d55fSchristos * \#include <assert.h>
22*91f7d55fSchristos * \#include <stdint.h>
23*91f7d55fSchristos * \#include <stdio.h>
24*91f7d55fSchristos * \#include <string.h>
25*91f7d55fSchristos * Replaced the above includes with Unbound's config.h
26*91f7d55fSchristos */
27*91f7d55fSchristos #include "config.h"
28*91f7d55fSchristos
29*91f7d55fSchristos /** EDIT
30*91f7d55fSchristos * prevent warning from -Wmissing-prototypes
31*91f7d55fSchristos */
32*91f7d55fSchristos #include "util/siphash.h"
33*91f7d55fSchristos
34*91f7d55fSchristos /* default: SipHash-2-4 */
35*91f7d55fSchristos #define cROUNDS 2
36*91f7d55fSchristos #define dROUNDS 4
37*91f7d55fSchristos
38*91f7d55fSchristos #define ROTL(x, b) (uint64_t)(((x) << (b)) | ((x) >> (64 - (b))))
39*91f7d55fSchristos
40*91f7d55fSchristos #define U32TO8_LE(p, v) \
41*91f7d55fSchristos (p)[0] = (uint8_t)((v)); \
42*91f7d55fSchristos (p)[1] = (uint8_t)((v) >> 8); \
43*91f7d55fSchristos (p)[2] = (uint8_t)((v) >> 16); \
44*91f7d55fSchristos (p)[3] = (uint8_t)((v) >> 24);
45*91f7d55fSchristos
46*91f7d55fSchristos #define U64TO8_LE(p, v) \
47*91f7d55fSchristos U32TO8_LE((p), (uint32_t)((v))); \
48*91f7d55fSchristos U32TO8_LE((p) + 4, (uint32_t)((v) >> 32));
49*91f7d55fSchristos
50*91f7d55fSchristos #define U8TO64_LE(p) \
51*91f7d55fSchristos (((uint64_t)((p)[0])) | ((uint64_t)((p)[1]) << 8) | \
52*91f7d55fSchristos ((uint64_t)((p)[2]) << 16) | ((uint64_t)((p)[3]) << 24) | \
53*91f7d55fSchristos ((uint64_t)((p)[4]) << 32) | ((uint64_t)((p)[5]) << 40) | \
54*91f7d55fSchristos ((uint64_t)((p)[6]) << 48) | ((uint64_t)((p)[7]) << 56))
55*91f7d55fSchristos
56*91f7d55fSchristos #define SIPROUND \
57*91f7d55fSchristos do { \
58*91f7d55fSchristos v0 += v1; \
59*91f7d55fSchristos v1 = ROTL(v1, 13); \
60*91f7d55fSchristos v1 ^= v0; \
61*91f7d55fSchristos v0 = ROTL(v0, 32); \
62*91f7d55fSchristos v2 += v3; \
63*91f7d55fSchristos v3 = ROTL(v3, 16); \
64*91f7d55fSchristos v3 ^= v2; \
65*91f7d55fSchristos v0 += v3; \
66*91f7d55fSchristos v3 = ROTL(v3, 21); \
67*91f7d55fSchristos v3 ^= v0; \
68*91f7d55fSchristos v2 += v1; \
69*91f7d55fSchristos v1 = ROTL(v1, 17); \
70*91f7d55fSchristos v1 ^= v2; \
71*91f7d55fSchristos v2 = ROTL(v2, 32); \
72*91f7d55fSchristos } while (0)
73*91f7d55fSchristos
74*91f7d55fSchristos #ifdef DEBUG
75*91f7d55fSchristos #define TRACE \
76*91f7d55fSchristos do { \
77*91f7d55fSchristos printf("(%3d) v0 %08x %08x\n", (int)inlen, (uint32_t)(v0 >> 32), \
78*91f7d55fSchristos (uint32_t)v0); \
79*91f7d55fSchristos printf("(%3d) v1 %08x %08x\n", (int)inlen, (uint32_t)(v1 >> 32), \
80*91f7d55fSchristos (uint32_t)v1); \
81*91f7d55fSchristos printf("(%3d) v2 %08x %08x\n", (int)inlen, (uint32_t)(v2 >> 32), \
82*91f7d55fSchristos (uint32_t)v2); \
83*91f7d55fSchristos printf("(%3d) v3 %08x %08x\n", (int)inlen, (uint32_t)(v3 >> 32), \
84*91f7d55fSchristos (uint32_t)v3); \
85*91f7d55fSchristos } while (0)
86*91f7d55fSchristos #else
87*91f7d55fSchristos #define TRACE
88*91f7d55fSchristos #endif
89*91f7d55fSchristos
siphash(const uint8_t * in,const size_t inlen,const uint8_t * k,uint8_t * out,const size_t outlen)90*91f7d55fSchristos int siphash(const uint8_t *in, const size_t inlen, const uint8_t *k,
91*91f7d55fSchristos uint8_t *out, const size_t outlen) {
92*91f7d55fSchristos
93*91f7d55fSchristos uint64_t v0 = 0x736f6d6570736575ULL;
94*91f7d55fSchristos uint64_t v1 = 0x646f72616e646f6dULL;
95*91f7d55fSchristos uint64_t v2 = 0x6c7967656e657261ULL;
96*91f7d55fSchristos uint64_t v3 = 0x7465646279746573ULL;
97*91f7d55fSchristos uint64_t k0 = U8TO64_LE(k);
98*91f7d55fSchristos uint64_t k1 = U8TO64_LE(k + 8);
99*91f7d55fSchristos uint64_t m;
100*91f7d55fSchristos int i;
101*91f7d55fSchristos const uint8_t *end = in + inlen - (inlen % sizeof(uint64_t));
102*91f7d55fSchristos const int left = inlen & 7;
103*91f7d55fSchristos uint64_t b = ((uint64_t)inlen) << 56;
104*91f7d55fSchristos /** EDIT
105*91f7d55fSchristos * The following assert moved here from the top for C90 compliance.
106*91f7d55fSchristos */
107*91f7d55fSchristos assert((outlen == 8) || (outlen == 16));
108*91f7d55fSchristos v3 ^= k1;
109*91f7d55fSchristos v2 ^= k0;
110*91f7d55fSchristos v1 ^= k1;
111*91f7d55fSchristos v0 ^= k0;
112*91f7d55fSchristos
113*91f7d55fSchristos if (outlen == 16)
114*91f7d55fSchristos v1 ^= 0xee;
115*91f7d55fSchristos
116*91f7d55fSchristos for (; in != end; in += 8) {
117*91f7d55fSchristos m = U8TO64_LE(in);
118*91f7d55fSchristos v3 ^= m;
119*91f7d55fSchristos
120*91f7d55fSchristos TRACE;
121*91f7d55fSchristos for (i = 0; i < cROUNDS; ++i)
122*91f7d55fSchristos SIPROUND;
123*91f7d55fSchristos
124*91f7d55fSchristos v0 ^= m;
125*91f7d55fSchristos }
126*91f7d55fSchristos
127*91f7d55fSchristos switch (left) {
128*91f7d55fSchristos case 7:
129*91f7d55fSchristos b |= ((uint64_t)in[6]) << 48;
130*91f7d55fSchristos /** EDIT annotate case statement fallthrough for gcc */
131*91f7d55fSchristos /* fallthrough */
132*91f7d55fSchristos case 6:
133*91f7d55fSchristos b |= ((uint64_t)in[5]) << 40;
134*91f7d55fSchristos /** EDIT annotate case statement fallthrough for gcc */
135*91f7d55fSchristos /* fallthrough */
136*91f7d55fSchristos case 5:
137*91f7d55fSchristos b |= ((uint64_t)in[4]) << 32;
138*91f7d55fSchristos /** EDIT annotate case statement fallthrough for gcc */
139*91f7d55fSchristos /* fallthrough */
140*91f7d55fSchristos case 4:
141*91f7d55fSchristos b |= ((uint64_t)in[3]) << 24;
142*91f7d55fSchristos /** EDIT annotate case statement fallthrough for gcc */
143*91f7d55fSchristos /* fallthrough */
144*91f7d55fSchristos case 3:
145*91f7d55fSchristos b |= ((uint64_t)in[2]) << 16;
146*91f7d55fSchristos /** EDIT annotate case statement fallthrough for gcc */
147*91f7d55fSchristos /* fallthrough */
148*91f7d55fSchristos case 2:
149*91f7d55fSchristos b |= ((uint64_t)in[1]) << 8;
150*91f7d55fSchristos /** EDIT annotate case statement fallthrough for gcc */
151*91f7d55fSchristos /* fallthrough */
152*91f7d55fSchristos case 1:
153*91f7d55fSchristos b |= ((uint64_t)in[0]);
154*91f7d55fSchristos break;
155*91f7d55fSchristos case 0:
156*91f7d55fSchristos break;
157*91f7d55fSchristos }
158*91f7d55fSchristos
159*91f7d55fSchristos v3 ^= b;
160*91f7d55fSchristos
161*91f7d55fSchristos TRACE;
162*91f7d55fSchristos for (i = 0; i < cROUNDS; ++i)
163*91f7d55fSchristos SIPROUND;
164*91f7d55fSchristos
165*91f7d55fSchristos v0 ^= b;
166*91f7d55fSchristos
167*91f7d55fSchristos if (outlen == 16)
168*91f7d55fSchristos v2 ^= 0xee;
169*91f7d55fSchristos else
170*91f7d55fSchristos v2 ^= 0xff;
171*91f7d55fSchristos
172*91f7d55fSchristos TRACE;
173*91f7d55fSchristos for (i = 0; i < dROUNDS; ++i)
174*91f7d55fSchristos SIPROUND;
175*91f7d55fSchristos
176*91f7d55fSchristos b = v0 ^ v1 ^ v2 ^ v3;
177*91f7d55fSchristos U64TO8_LE(out, b);
178*91f7d55fSchristos
179*91f7d55fSchristos if (outlen == 8)
180*91f7d55fSchristos return 0;
181*91f7d55fSchristos
182*91f7d55fSchristos v1 ^= 0xdd;
183*91f7d55fSchristos
184*91f7d55fSchristos TRACE;
185*91f7d55fSchristos for (i = 0; i < dROUNDS; ++i)
186*91f7d55fSchristos SIPROUND;
187*91f7d55fSchristos
188*91f7d55fSchristos b = v0 ^ v1 ^ v2 ^ v3;
189*91f7d55fSchristos U64TO8_LE(out + 8, b);
190*91f7d55fSchristos
191*91f7d55fSchristos return 0;
192*91f7d55fSchristos }
193