2 ddd12270 2022-04-22 thomas * Copyright (c) 2013 Andre Oppermann <andre@FreeBSD.org>
3 ddd12270 2022-04-22 thomas * All rights reserved.
5 ddd12270 2022-04-22 thomas * Redistribution and use in source and binary forms, with or without
6 ddd12270 2022-04-22 thomas * modification, are permitted provided that the following conditions
8 ddd12270 2022-04-22 thomas * 1. Redistributions of source code must retain the above copyright
9 ddd12270 2022-04-22 thomas * notice, this list of conditions and the following disclaimer.
10 ddd12270 2022-04-22 thomas * 2. Redistributions in binary form must reproduce the above copyright
11 ddd12270 2022-04-22 thomas * notice, this list of conditions and the following disclaimer in the
12 ddd12270 2022-04-22 thomas * documentation and/or other materials provided with the distribution.
13 ddd12270 2022-04-22 thomas * 3. The name of the author may not be used to endorse or promote
14 ddd12270 2022-04-22 thomas * products derived from this software without specific prior written
15 ddd12270 2022-04-22 thomas * permission.
17 ddd12270 2022-04-22 thomas * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 ddd12270 2022-04-22 thomas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 ddd12270 2022-04-22 thomas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 ddd12270 2022-04-22 thomas * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 ddd12270 2022-04-22 thomas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 ddd12270 2022-04-22 thomas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 ddd12270 2022-04-22 thomas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 ddd12270 2022-04-22 thomas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 ddd12270 2022-04-22 thomas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 ddd12270 2022-04-22 thomas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 ddd12270 2022-04-22 thomas * SUCH DAMAGE.
29 ddd12270 2022-04-22 thomas * $OpenBSD: siphash.h,v 1.3 2015/02/20 11:51:03 tedu Exp $
33 ddd12270 2022-04-22 thomas * SipHash is a family of pseudorandom functions (a.k.a. keyed hash functions)
34 ddd12270 2022-04-22 thomas * optimized for speed on short messages returning a 64bit hash/digest value.
36 ddd12270 2022-04-22 thomas * The number of rounds is defined during the initialization:
37 ddd12270 2022-04-22 thomas * SipHash24_Init() for the fast and resonable strong version
38 ddd12270 2022-04-22 thomas * SipHash48_Init() for the strong version (half as fast)
40 ddd12270 2022-04-22 thomas * struct SIPHASH_CTX ctx;
41 ddd12270 2022-04-22 thomas * SipHash24_Init(&ctx);
42 ddd12270 2022-04-22 thomas * SipHash_SetKey(&ctx, "16bytes long key");
43 ddd12270 2022-04-22 thomas * SipHash_Update(&ctx, pointer_to_string, length_of_string);
44 ddd12270 2022-04-22 thomas * SipHash_Final(output, &ctx);
47 ddd12270 2022-04-22 thomas #ifndef _SIPHASH_H_
48 ddd12270 2022-04-22 thomas #define _SIPHASH_H_
50 ddd12270 2022-04-22 thomas #define SIPHASH_BLOCK_LENGTH 8
51 ddd12270 2022-04-22 thomas #define SIPHASH_KEY_LENGTH 16
52 ddd12270 2022-04-22 thomas #define SIPHASH_DIGEST_LENGTH 8
54 ddd12270 2022-04-22 thomas typedef struct _SIPHASH_CTX {
55 ddd12270 2022-04-22 thomas uint64_t v[4];
56 ddd12270 2022-04-22 thomas uint8_t buf[SIPHASH_BLOCK_LENGTH];
57 ddd12270 2022-04-22 thomas uint32_t bytes;
58 ddd12270 2022-04-22 thomas } SIPHASH_CTX;
60 ddd12270 2022-04-22 thomas typedef struct {
61 ddd12270 2022-04-22 thomas uint64_t k0;
62 ddd12270 2022-04-22 thomas uint64_t k1;
63 ddd12270 2022-04-22 thomas } SIPHASH_KEY;
65 ddd12270 2022-04-22 thomas void SipHash_Init(SIPHASH_CTX *, const SIPHASH_KEY *);
66 ddd12270 2022-04-22 thomas void SipHash_Update(SIPHASH_CTX *, int, int, const void *, size_t);
67 ddd12270 2022-04-22 thomas uint64_t SipHash_End(SIPHASH_CTX *, int, int);
68 ddd12270 2022-04-22 thomas void SipHash_Final(void *, SIPHASH_CTX *, int, int);
69 ddd12270 2022-04-22 thomas uint64_t SipHash(const SIPHASH_KEY *, int, int, const void *, size_t);
71 ddd12270 2022-04-22 thomas #define SipHash24_Init(_c, _k) SipHash_Init((_c), (_k))
72 ddd12270 2022-04-22 thomas #define SipHash24_Update(_c, _p, _l) SipHash_Update((_c), 2, 4, (_p), (_l))
73 ddd12270 2022-04-22 thomas #define SipHash24_End(_d) SipHash_End((_d), 2, 4)
74 ddd12270 2022-04-22 thomas #define SipHash24_Final(_d, _c) SipHash_Final((_d), (_c), 2, 4)
75 ddd12270 2022-04-22 thomas #define SipHash24(_k, _p, _l) SipHash((_k), 2, 4, (_p), (_l))
77 ddd12270 2022-04-22 thomas #define SipHash48_Init(_c, _k) SipHash_Init((_c), (_k))
78 ddd12270 2022-04-22 thomas #define SipHash48_Update(_c, _p, _l) SipHash_Update((_c), 4, 8, (_p), (_l))
79 ddd12270 2022-04-22 thomas #define SipHash48_End(_d) SipHash_End((_d), 4, 8)
80 ddd12270 2022-04-22 thomas #define SipHash48_Final(_d, _c) SipHash_Final((_d), (_c), 4, 8)
81 ddd12270 2022-04-22 thomas #define SipHash48(_k, _p, _l) SipHash((_k), 4, 8, (_p), (_l))
83 ddd12270 2022-04-22 thomas #endif /* _SIPHASH_H_ */
