siphash-hash-function.scroll

import ../code/conceptPage.scroll

id siphash-hash-function
name SipHash
appeared 2011
tags hashFunction

country Switzerland and United States
originCommunity Nagravision SA and University of Illinois
reference https://ieeexplore.ieee.org/author/37546786200

wikipedia https://en.wikipedia.org/wiki/SipHash
 summary SipHash is an add–rotate–xor (ARX) based family of pseudorandom functions created by Jean-Philippe Aumasson and Daniel J. Bernstein in 2012, in response to a spate of "hash flooding" denial-of-service attacks in late 2011.Although designed for use as a hash function in the computer science sense, SipHash is fundamentally different from cryptographic hash functions like SHA in that it is only suitable as a message authentication code: a keyed hash function like HMAC.  That is, SHA is designed so that it is difficult for an attacker to find two messages X and Y such that SHA(X) = SHA(Y), even though anyone may compute SHA(X).  SipHash instead guarantees that, having seen Xi and SipHash(Xi, k), an attacker who does not know the key k cannot find (any information about) k or SipHash(Y, k) for any message Y ∉ {Xi} which they have not seen before.
 backlinksCount 125
 pageId 37927149
 dailyPageViews 70
 appeared 2011