6856398eab
hash function) optimized for speed on short messages returning a 64bit hash/ digest value. SipHash is simpler and much faster than other secure MACs and competitive in speed with popular non-cryptographic hash functions. It uses a 128-bit key without the hidden cost of a key expansion step. SipHash iterates a simple round function consisting of four additions, four xors, and six rotations, interleaved with xors of message blocks for a pre-defined number of compression and finalization rounds. The absence of secret load/store addresses or secret branch conditions avoid timing attacks. No state is shared between messages. Hashing is deterministic and doesn't use nonces. It is not susceptible to length extension attacks. Target applications include network traffic authentication, message authentication (MAC) and hash-tables protection against hash-flooding denial-of-service attacks. The number of update/finalization rounds is defined during initialization: SipHash24_Init() for the fast and reasonable strong version. SipHash48_Init() for the strong version (half as fast). SipHash usage is similar to other hash functions: struct SIPHASH_CTX ctx; char *k = "16bytes long key" char *s = "string"; uint64_t h = 0; SipHash24_Init(&ctx); SipHash_SetKey(&ctx, k); SipHash_Update(&ctx, s, strlen(s)); SipHash_Final(&h, &ctx); /* or */ h = SipHash_End(&ctx); /* or */ h = SipHash24(&ctx, k, s, strlen(s)); It was designed by Jean-Philippe Aumasson and Daniel J. Bernstein and is described in the paper "SipHash: a fast short-input PRF", 2012.09.18: https://131002.net/siphash/siphash.pdf Permanent ID: b9a943a805fbfc6fde808af9fc0ecdfa Implemented by: andre (based on the paper) Reviewed by: cperciva
84 lines
3.0 KiB
C
84 lines
3.0 KiB
C
/*-
|
|
* Copyright (c) 2013 Andre Oppermann <andre@FreeBSD.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote
|
|
* products derived from this software without specific prior written
|
|
* permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
/*
|
|
* SipHash is a family of pseudorandom functions (a.k.a. keyed hash functions)
|
|
* optimized for speed on short messages returning a 64bit hash/digest value.
|
|
*
|
|
* The number of rounds is defined during the initialization:
|
|
* SipHash24_Init() for the fast and resonable strong version
|
|
* SipHash48_Init() for the strong version (half as fast)
|
|
*
|
|
* struct SIPHASH_CTX ctx;
|
|
* SipHash24_Init(&ctx);
|
|
* SipHash_SetKey(&ctx, "16bytes long key");
|
|
* SipHash_Update(&ctx, pointer_to_string, length_of_string);
|
|
* SipHash_Final(output, &ctx);
|
|
*/
|
|
|
|
#ifndef _SIPHASH_H_
|
|
#define _SIPHASH_H_
|
|
|
|
#define SIPHASH_BLOCK_LENGTH 8
|
|
#define SIPHASH_KEY_LENGTH 16
|
|
#define SIPHASH_DIGEST_LENGTH 8
|
|
|
|
typedef struct _SIPHASH_CTX {
|
|
uint64_t v[4];
|
|
union {
|
|
uint64_t b64;
|
|
uint8_t b8[8];
|
|
} buf;
|
|
uint64_t bytes;
|
|
uint8_t buflen;
|
|
uint8_t rounds_compr;
|
|
uint8_t rounds_final;
|
|
uint8_t initialized;
|
|
} SIPHASH_CTX;
|
|
|
|
|
|
#define SipHash24_Init(x) SipHash_InitX((x), 2, 4)
|
|
#define SipHash48_Init(x) SipHash_InitX((x), 4, 8)
|
|
void SipHash_InitX(SIPHASH_CTX *, int, int);
|
|
void SipHash_SetKey(SIPHASH_CTX *, const uint8_t [16]);
|
|
void SipHash_Update(SIPHASH_CTX *, const void *, size_t);
|
|
void SipHash_Final(void *, SIPHASH_CTX *);
|
|
uint64_t SipHash_End(SIPHASH_CTX *);
|
|
|
|
#define SipHash24(x, y, z, i) SipHashX((x), 2, 4, (y), (z), (i));
|
|
#define SipHash48(x, y, z, i) SipHashX((x), 4, 8, (y), (z), (i));
|
|
uint64_t SipHashX(SIPHASH_CTX *, int, int, const uint8_t [16], const void *,
|
|
size_t);
|
|
|
|
int SipHash24_TestVectors(void);
|
|
|
|
#endif /* _SIPHASH_H_ */
|