siphash.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374
  1. /* ==========================================================================
  2. * siphash.h - SipHash-2-4 in a single header file
  3. * --------------------------------------------------------------------------
  4. * Derived by William Ahern from the reference implementation[1] published[2]
  5. * by Jean-Philippe Aumasson and Daniel J. Berstein.
  6. * Minimal changes by Sebastian Pipping and Victor Stinner on top, see below.
  7. * Licensed under the CC0 Public Domain Dedication license.
  8. *
  9. * 1. https://www.131002.net/siphash/siphash24.c
  10. * 2. https://www.131002.net/siphash/
  11. * --------------------------------------------------------------------------
  12. * HISTORY:
  13. *
  14. * 2017-07-25 (Vadim Zeitlin)
  15. * - Fix use of SIPHASH_MAIN macro
  16. *
  17. * 2017-07-05 (Sebastian Pipping)
  18. * - Use _SIP_ULL macro to not require a C++11 compiler if compiled as C++
  19. * - Add const qualifiers at two places
  20. * - Ensure <=80 characters line length (assuming tab width 4)
  21. *
  22. * 2017-06-23 (Victor Stinner)
  23. * - Address Win64 compile warnings
  24. *
  25. * 2017-06-18 (Sebastian Pipping)
  26. * - Clarify license note in the header
  27. * - Address C89 issues:
  28. * - Stop using inline keyword (and let compiler decide)
  29. * - Replace _Bool by int
  30. * - Turn macro siphash24 into a function
  31. * - Address invalid conversion (void pointer) by explicit cast
  32. * - Address lack of stdint.h for Visual Studio 2003 to 2008
  33. * - Always expose sip24_valid (for self-tests)
  34. *
  35. * 2012-11-04 - Born. (William Ahern)
  36. * --------------------------------------------------------------------------
  37. * USAGE:
  38. *
  39. * SipHash-2-4 takes as input two 64-bit words as the key, some number of
  40. * message bytes, and outputs a 64-bit word as the message digest. This
  41. * implementation employs two data structures: a struct sipkey for
  42. * representing the key, and a struct siphash for representing the hash
  43. * state.
  44. *
  45. * For converting a 16-byte unsigned char array to a key, use either the
  46. * macro sip_keyof or the routine sip_tokey. The former instantiates a
  47. * compound literal key, while the latter requires a key object as a
  48. * parameter.
  49. *
  50. * unsigned char secret[16];
  51. * arc4random_buf(secret, sizeof secret);
  52. * struct sipkey *key = sip_keyof(secret);
  53. *
  54. * For hashing a message, use either the convenience macro siphash24 or the
  55. * routines sip24_init, sip24_update, and sip24_final.
  56. *
  57. * struct siphash state;
  58. * void *msg;
  59. * size_t len;
  60. * uint64_t hash;
  61. *
  62. * sip24_init(&state, key);
  63. * sip24_update(&state, msg, len);
  64. * hash = sip24_final(&state);
  65. *
  66. * or
  67. *
  68. * hash = siphash24(msg, len, key);
  69. *
  70. * To convert the 64-bit hash value to a canonical 8-byte little-endian
  71. * binary representation, use either the macro sip_binof or the routine
  72. * sip_tobin. The former instantiates and returns a compound literal array,
  73. * while the latter requires an array object as a parameter.
  74. * --------------------------------------------------------------------------
  75. * NOTES:
  76. *
  77. * o Neither sip_keyof, sip_binof, nor siphash24 will work with compilers
  78. * lacking compound literal support. Instead, you must use the lower-level
  79. * interfaces which take as parameters the temporary state objects.
  80. *
  81. * o Uppercase macros may evaluate parameters more than once. Lowercase
  82. * macros should not exhibit any such side effects.
  83. * ==========================================================================
  84. */
  85. #ifndef SIPHASH_H
  86. #define SIPHASH_H
  87. #include <stddef.h> /* size_t */
  88. #if defined(_WIN32) && defined(_MSC_VER) && (_MSC_VER < 1600)
  89. /* For vs2003/7.1 up to vs2008/9.0; _MSC_VER 1600 is vs2010/10.0 */
  90. typedef unsigned __int8 uint8_t;
  91. typedef unsigned __int32 uint32_t;
  92. typedef unsigned __int64 uint64_t;
  93. #else
  94. #include <stdint.h> /* uint64_t uint32_t uint8_t */
  95. #endif
  96. /*
  97. * Workaround to not require a C++11 compiler for using ULL suffix
  98. * if this code is included and compiled as C++; related GCC warning is:
  99. * warning: use of C++11 long long integer constant [-Wlong-long]
  100. */
  101. #define _SIP_ULL(high, low) (((uint64_t)high << 32) | low)
  102. #define SIP_ROTL(x, b) (uint64_t)(((x) << (b)) | ( (x) >> (64 - (b))))
  103. #define SIP_U32TO8_LE(p, v) \
  104. (p)[0] = (uint8_t)((v) >> 0); (p)[1] = (uint8_t)((v) >> 8); \
  105. (p)[2] = (uint8_t)((v) >> 16); (p)[3] = (uint8_t)((v) >> 24);
  106. #define SIP_U64TO8_LE(p, v) \
  107. SIP_U32TO8_LE((p) + 0, (uint32_t)((v) >> 0)); \
  108. SIP_U32TO8_LE((p) + 4, (uint32_t)((v) >> 32));
  109. #define SIP_U8TO64_LE(p) \
  110. (((uint64_t)((p)[0]) << 0) | \
  111. ((uint64_t)((p)[1]) << 8) | \
  112. ((uint64_t)((p)[2]) << 16) | \
  113. ((uint64_t)((p)[3]) << 24) | \
  114. ((uint64_t)((p)[4]) << 32) | \
  115. ((uint64_t)((p)[5]) << 40) | \
  116. ((uint64_t)((p)[6]) << 48) | \
  117. ((uint64_t)((p)[7]) << 56))
  118. #define SIPHASH_INITIALIZER { 0, 0, 0, 0, { 0 }, 0, 0 }
  119. struct siphash {
  120. uint64_t v0, v1, v2, v3;
  121. unsigned char buf[8], *p;
  122. uint64_t c;
  123. }; /* struct siphash */
  124. #define SIP_KEYLEN 16
  125. struct sipkey {
  126. uint64_t k[2];
  127. }; /* struct sipkey */
  128. #define sip_keyof(k) sip_tokey(&(struct sipkey){ { 0 } }, (k))
  129. static struct sipkey *sip_tokey(struct sipkey *key, const void *src) {
  130. key->k[0] = SIP_U8TO64_LE((const unsigned char *)src);
  131. key->k[1] = SIP_U8TO64_LE((const unsigned char *)src + 8);
  132. return key;
  133. } /* sip_tokey() */
  134. #define sip_binof(v) sip_tobin((unsigned char[8]){ 0 }, (v))
  135. static void *sip_tobin(void *dst, uint64_t u64) {
  136. SIP_U64TO8_LE((unsigned char *)dst, u64);
  137. return dst;
  138. } /* sip_tobin() */
  139. static void sip_round(struct siphash *H, const int rounds) {
  140. int i;
  141. for (i = 0; i < rounds; i++) {
  142. H->v0 += H->v1;
  143. H->v1 = SIP_ROTL(H->v1, 13);
  144. H->v1 ^= H->v0;
  145. H->v0 = SIP_ROTL(H->v0, 32);
  146. H->v2 += H->v3;
  147. H->v3 = SIP_ROTL(H->v3, 16);
  148. H->v3 ^= H->v2;
  149. H->v0 += H->v3;
  150. H->v3 = SIP_ROTL(H->v3, 21);
  151. H->v3 ^= H->v0;
  152. H->v2 += H->v1;
  153. H->v1 = SIP_ROTL(H->v1, 17);
  154. H->v1 ^= H->v2;
  155. H->v2 = SIP_ROTL(H->v2, 32);
  156. }
  157. } /* sip_round() */
  158. static struct siphash *sip24_init(struct siphash *H,
  159. const struct sipkey *key) {
  160. H->v0 = _SIP_ULL(0x736f6d65U, 0x70736575U) ^ key->k[0];
  161. H->v1 = _SIP_ULL(0x646f7261U, 0x6e646f6dU) ^ key->k[1];
  162. H->v2 = _SIP_ULL(0x6c796765U, 0x6e657261U) ^ key->k[0];
  163. H->v3 = _SIP_ULL(0x74656462U, 0x79746573U) ^ key->k[1];
  164. H->p = H->buf;
  165. H->c = 0;
  166. return H;
  167. } /* sip24_init() */
  168. #define sip_endof(a) (&(a)[sizeof (a) / sizeof *(a)])
  169. static struct siphash *sip24_update(struct siphash *H, const void *src,
  170. size_t len) {
  171. const unsigned char *p = (const unsigned char *)src, *pe = p + len;
  172. uint64_t m;
  173. do {
  174. while (p < pe && H->p < sip_endof(H->buf))
  175. *H->p++ = *p++;
  176. if (H->p < sip_endof(H->buf))
  177. break;
  178. m = SIP_U8TO64_LE(H->buf);
  179. H->v3 ^= m;
  180. sip_round(H, 2);
  181. H->v0 ^= m;
  182. H->p = H->buf;
  183. H->c += 8;
  184. } while (p < pe);
  185. return H;
  186. } /* sip24_update() */
  187. static uint64_t sip24_final(struct siphash *H) {
  188. const char left = (char)(H->p - H->buf);
  189. uint64_t b = (H->c + left) << 56;
  190. switch (left) {
  191. case 7: b |= (uint64_t)H->buf[6] << 48;
  192. case 6: b |= (uint64_t)H->buf[5] << 40;
  193. case 5: b |= (uint64_t)H->buf[4] << 32;
  194. case 4: b |= (uint64_t)H->buf[3] << 24;
  195. case 3: b |= (uint64_t)H->buf[2] << 16;
  196. case 2: b |= (uint64_t)H->buf[1] << 8;
  197. case 1: b |= (uint64_t)H->buf[0] << 0;
  198. case 0: break;
  199. }
  200. H->v3 ^= b;
  201. sip_round(H, 2);
  202. H->v0 ^= b;
  203. H->v2 ^= 0xff;
  204. sip_round(H, 4);
  205. return H->v0 ^ H->v1 ^ H->v2 ^ H->v3;
  206. } /* sip24_final() */
  207. static uint64_t siphash24(const void *src, size_t len,
  208. const struct sipkey *key) {
  209. struct siphash state = SIPHASH_INITIALIZER;
  210. return sip24_final(sip24_update(sip24_init(&state, key), src, len));
  211. } /* siphash24() */
  212. /*
  213. * SipHash-2-4 output with
  214. * k = 00 01 02 ...
  215. * and
  216. * in = (empty string)
  217. * in = 00 (1 byte)
  218. * in = 00 01 (2 bytes)
  219. * in = 00 01 02 (3 bytes)
  220. * ...
  221. * in = 00 01 02 ... 3e (63 bytes)
  222. */
  223. static int sip24_valid(void) {
  224. static const unsigned char vectors[64][8] = {
  225. { 0x31, 0x0e, 0x0e, 0xdd, 0x47, 0xdb, 0x6f, 0x72, },
  226. { 0xfd, 0x67, 0xdc, 0x93, 0xc5, 0x39, 0xf8, 0x74, },
  227. { 0x5a, 0x4f, 0xa9, 0xd9, 0x09, 0x80, 0x6c, 0x0d, },
  228. { 0x2d, 0x7e, 0xfb, 0xd7, 0x96, 0x66, 0x67, 0x85, },
  229. { 0xb7, 0x87, 0x71, 0x27, 0xe0, 0x94, 0x27, 0xcf, },
  230. { 0x8d, 0xa6, 0x99, 0xcd, 0x64, 0x55, 0x76, 0x18, },
  231. { 0xce, 0xe3, 0xfe, 0x58, 0x6e, 0x46, 0xc9, 0xcb, },
  232. { 0x37, 0xd1, 0x01, 0x8b, 0xf5, 0x00, 0x02, 0xab, },
  233. { 0x62, 0x24, 0x93, 0x9a, 0x79, 0xf5, 0xf5, 0x93, },
  234. { 0xb0, 0xe4, 0xa9, 0x0b, 0xdf, 0x82, 0x00, 0x9e, },
  235. { 0xf3, 0xb9, 0xdd, 0x94, 0xc5, 0xbb, 0x5d, 0x7a, },
  236. { 0xa7, 0xad, 0x6b, 0x22, 0x46, 0x2f, 0xb3, 0xf4, },
  237. { 0xfb, 0xe5, 0x0e, 0x86, 0xbc, 0x8f, 0x1e, 0x75, },
  238. { 0x90, 0x3d, 0x84, 0xc0, 0x27, 0x56, 0xea, 0x14, },
  239. { 0xee, 0xf2, 0x7a, 0x8e, 0x90, 0xca, 0x23, 0xf7, },
  240. { 0xe5, 0x45, 0xbe, 0x49, 0x61, 0xca, 0x29, 0xa1, },
  241. { 0xdb, 0x9b, 0xc2, 0x57, 0x7f, 0xcc, 0x2a, 0x3f, },
  242. { 0x94, 0x47, 0xbe, 0x2c, 0xf5, 0xe9, 0x9a, 0x69, },
  243. { 0x9c, 0xd3, 0x8d, 0x96, 0xf0, 0xb3, 0xc1, 0x4b, },
  244. { 0xbd, 0x61, 0x79, 0xa7, 0x1d, 0xc9, 0x6d, 0xbb, },
  245. { 0x98, 0xee, 0xa2, 0x1a, 0xf2, 0x5c, 0xd6, 0xbe, },
  246. { 0xc7, 0x67, 0x3b, 0x2e, 0xb0, 0xcb, 0xf2, 0xd0, },
  247. { 0x88, 0x3e, 0xa3, 0xe3, 0x95, 0x67, 0x53, 0x93, },
  248. { 0xc8, 0xce, 0x5c, 0xcd, 0x8c, 0x03, 0x0c, 0xa8, },
  249. { 0x94, 0xaf, 0x49, 0xf6, 0xc6, 0x50, 0xad, 0xb8, },
  250. { 0xea, 0xb8, 0x85, 0x8a, 0xde, 0x92, 0xe1, 0xbc, },
  251. { 0xf3, 0x15, 0xbb, 0x5b, 0xb8, 0x35, 0xd8, 0x17, },
  252. { 0xad, 0xcf, 0x6b, 0x07, 0x63, 0x61, 0x2e, 0x2f, },
  253. { 0xa5, 0xc9, 0x1d, 0xa7, 0xac, 0xaa, 0x4d, 0xde, },
  254. { 0x71, 0x65, 0x95, 0x87, 0x66, 0x50, 0xa2, 0xa6, },
  255. { 0x28, 0xef, 0x49, 0x5c, 0x53, 0xa3, 0x87, 0xad, },
  256. { 0x42, 0xc3, 0x41, 0xd8, 0xfa, 0x92, 0xd8, 0x32, },
  257. { 0xce, 0x7c, 0xf2, 0x72, 0x2f, 0x51, 0x27, 0x71, },
  258. { 0xe3, 0x78, 0x59, 0xf9, 0x46, 0x23, 0xf3, 0xa7, },
  259. { 0x38, 0x12, 0x05, 0xbb, 0x1a, 0xb0, 0xe0, 0x12, },
  260. { 0xae, 0x97, 0xa1, 0x0f, 0xd4, 0x34, 0xe0, 0x15, },
  261. { 0xb4, 0xa3, 0x15, 0x08, 0xbe, 0xff, 0x4d, 0x31, },
  262. { 0x81, 0x39, 0x62, 0x29, 0xf0, 0x90, 0x79, 0x02, },
  263. { 0x4d, 0x0c, 0xf4, 0x9e, 0xe5, 0xd4, 0xdc, 0xca, },
  264. { 0x5c, 0x73, 0x33, 0x6a, 0x76, 0xd8, 0xbf, 0x9a, },
  265. { 0xd0, 0xa7, 0x04, 0x53, 0x6b, 0xa9, 0x3e, 0x0e, },
  266. { 0x92, 0x59, 0x58, 0xfc, 0xd6, 0x42, 0x0c, 0xad, },
  267. { 0xa9, 0x15, 0xc2, 0x9b, 0xc8, 0x06, 0x73, 0x18, },
  268. { 0x95, 0x2b, 0x79, 0xf3, 0xbc, 0x0a, 0xa6, 0xd4, },
  269. { 0xf2, 0x1d, 0xf2, 0xe4, 0x1d, 0x45, 0x35, 0xf9, },
  270. { 0x87, 0x57, 0x75, 0x19, 0x04, 0x8f, 0x53, 0xa9, },
  271. { 0x10, 0xa5, 0x6c, 0xf5, 0xdf, 0xcd, 0x9a, 0xdb, },
  272. { 0xeb, 0x75, 0x09, 0x5c, 0xcd, 0x98, 0x6c, 0xd0, },
  273. { 0x51, 0xa9, 0xcb, 0x9e, 0xcb, 0xa3, 0x12, 0xe6, },
  274. { 0x96, 0xaf, 0xad, 0xfc, 0x2c, 0xe6, 0x66, 0xc7, },
  275. { 0x72, 0xfe, 0x52, 0x97, 0x5a, 0x43, 0x64, 0xee, },
  276. { 0x5a, 0x16, 0x45, 0xb2, 0x76, 0xd5, 0x92, 0xa1, },
  277. { 0xb2, 0x74, 0xcb, 0x8e, 0xbf, 0x87, 0x87, 0x0a, },
  278. { 0x6f, 0x9b, 0xb4, 0x20, 0x3d, 0xe7, 0xb3, 0x81, },
  279. { 0xea, 0xec, 0xb2, 0xa3, 0x0b, 0x22, 0xa8, 0x7f, },
  280. { 0x99, 0x24, 0xa4, 0x3c, 0xc1, 0x31, 0x57, 0x24, },
  281. { 0xbd, 0x83, 0x8d, 0x3a, 0xaf, 0xbf, 0x8d, 0xb7, },
  282. { 0x0b, 0x1a, 0x2a, 0x32, 0x65, 0xd5, 0x1a, 0xea, },
  283. { 0x13, 0x50, 0x79, 0xa3, 0x23, 0x1c, 0xe6, 0x60, },
  284. { 0x93, 0x2b, 0x28, 0x46, 0xe4, 0xd7, 0x06, 0x66, },
  285. { 0xe1, 0x91, 0x5f, 0x5c, 0xb1, 0xec, 0xa4, 0x6c, },
  286. { 0xf3, 0x25, 0x96, 0x5c, 0xa1, 0x6d, 0x62, 0x9f, },
  287. { 0x57, 0x5f, 0xf2, 0x8e, 0x60, 0x38, 0x1b, 0xe5, },
  288. { 0x72, 0x45, 0x06, 0xeb, 0x4c, 0x32, 0x8a, 0x95, }
  289. };
  290. unsigned char in[64];
  291. struct sipkey k;
  292. size_t i;
  293. sip_tokey(&k, "\000\001\002\003\004\005\006\007\010\011"
  294. "\012\013\014\015\016\017");
  295. for (i = 0; i < sizeof in; ++i) {
  296. in[i] = (unsigned char)i;
  297. if (siphash24(in, i, &k) != SIP_U8TO64_LE(vectors[i]))
  298. return 0;
  299. }
  300. return 1;
  301. } /* sip24_valid() */
  302. #ifdef SIPHASH_MAIN
  303. #include <stdio.h>
  304. int main(void) {
  305. const int ok = sip24_valid();
  306. if (ok)
  307. puts("OK");
  308. else
  309. puts("FAIL");
  310. return !ok;
  311. } /* main() */
  312. #endif /* SIPHASH_MAIN */
  313. #endif /* SIPHASH_H */