SipHash: a fast short-input PRF. SipHash is a family of pseudorandom functions optimized for short inputs. Target applications include network traffic authentication and hash-table lookups protected against hash-flooding denial-of-service attacks. SipHash is simpler than MACs based on universal hashing, and faster on short inputs. Compared to dedicated designs for hash-table lookup, SipHash has well-defined security goals and competitive performance. For example, SipHash processes a 16-byte input with a fresh key in 140 cycles on an AMD FX-8150 processor, which is much faster than state-of-the-art MACs. We propose that hash tables switch to SipHash as a hash function.
Keywords for this software
References in zbMATH (referenced in 10 articles )
Showing results 1 to 10 of 10.
- Apple, Jim: HalftimeHash: modern hashing without 64-bit multipliers or finite fields (2021)
- Chang, Jian; Wang, Lifang; Hao, Jin-Kao; Wang, Yang: Parallel iterative solution-based Tabu search for the obnoxious (p)-median problem (2021)
- Ghosh, Sebati; Sarkar, Palash: Variants of Wegman-Carter message authentication code supporting variable tag lengths (2021)
- Xin, Wenqian; Liu, Yunwen; Sun, Bing; Li, Chao: Improved cryptanalysis on SipHash (2019)
- Liu, Yunwen; Wang, Qingju; Rijmen, Vincent: Automatic search of linear trails in ARX with applications to SPECK and Chaskey (2016)
- Mavromati, Chrysanthi: Key-recovery attacks against the MAC algorithm chaskey (2016)
- Biryukov, Alex; Velichkov, Vesselin: Automatic search for differential trails in ARX ciphers (2014)
- Minematsu, Kazuhiko: Parallelizable rate-1 authenticated encryption from pseudorandom functions (2014)
- Leurent, Gaëtan: Construction of differential characteristics in ARX designs application to Skein (2013)
- Aumasson, Jean-Philippe; Bernstein, Daniel J.: SipHash: a fast short-input PRF (2012)