/* SPDX-License-Identifier: BSD-3-Clause */
/* $OpenBSD: siphash.h,v 1.5 2015/02/20 11:51:03 tedu Exp $ */
/*-
* 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 64 bit 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 , " 16 bytes long key " ) ;
* SipHash_Update ( & ctx , pointer_to_string , length_of_string ) ;
* SipHash_Final ( output , & ctx ) ;
*/
#ifndef _SIPHASH_H_
#define _SIPHASH_H_
#include <linux/types.h>
#define SIPHASH_BLOCK_LENGTH 8
#define SIPHASH_KEY_LENGTH 16
#define SIPHASH_DIGEST_LENGTH 8
typedef struct _SIPHASH_CTX {
u64 v[4 ];
u8 buf[SIPHASH_BLOCK_LENGTH];
u32 bytes;
} SIPHASH_CTX;
typedef struct {
__le64 k0;
__le64 k1;
} SIPHASH_KEY;
void SipHash_Init(SIPHASH_CTX *, const SIPHASH_KEY *);
void SipHash_Update(SIPHASH_CTX *, int , int , const void *, size_t);
u64 SipHash_End(SIPHASH_CTX *, int , int );
void SipHash_Final(void *, SIPHASH_CTX *, int , int );
u64 SipHash(const SIPHASH_KEY *, int , int , const void *, size_t);
#define SipHash24_Init(_c, _k) SipHash_Init((_c), (_k))
#define SipHash24_Update(_c, _p, _l) SipHash_Update((_c), 2 , 4 , (_p), (_l))
#define SipHash24_End(_d) SipHash_End((_d), 2 , 4 )
#define SipHash24_Final(_d, _c) SipHash_Final((_d), (_c), 2 , 4 )
#define SipHash24(_k, _p, _l) SipHash((_k), 2 , 4 , (_p), (_l))
#define SipHash48_Init(_c, _k) SipHash_Init((_c), (_k))
#define SipHash48_Update(_c, _p, _l) SipHash_Update((_c), 4 , 8 , (_p), (_l))
#define SipHash48_End(_d) SipHash_End((_d), 4 , 8 )
#define SipHash48_Final(_d, _c) SipHash_Final((_d), (_c), 4 , 8 )
#define SipHash48(_k, _p, _l) SipHash((_k), 4 , 8 , (_p), (_l))
#endif /* _SIPHASH_H_ */
Messung V0.5 in Prozent C=95 H=100 G=97
¤ Dauer der Verarbeitung: 0.11 Sekunden
(vorverarbeitet am 2026-09-28)
¤
*© Formatika GbR, Deutschland