SipHash: a fast short-input PRF
From MaRDI portal
Recommendations
Cited in
(21)- Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
- Rotational cryptanalysis from a differential-linear perspective. Practical distinguishers for round-reduced \texttt{FRIET}, \texttt{Xoodoo}, and \texttt{Alzette}
- Improved differential-linear attack with application to round-reduced Speck32/64
- Rotational differential-linear cryptanalysis revisited
- How to build optimally secure PRFs using block ciphers
- Differential cryptanalysis of SipHash
- Key-Recovery Attacks Against the MAC Algorithm Chaskey
- Automatic search of linear trails in ARX with applications to SPECK and Chaskey
- Improved cryptanalysis on SipHash
- scientific article; zbMATH DE number 2247680 (Why is no real title available?)
- Rotational differential-linear distinguishers of ARX ciphers with arbitrary output linear masks
- Latin dances reloaded: improved cryptanalysis against Salsa and ChaCha, and the proposal of Forró
- Latin dances reloaded: improved cryptanalysis against Salsa and ChaCha, and the proposal of Forró
- Categorization of faulty nonce misuse resistant message authentication
- Optimized reversible cellular automata based clustering
- Defending hash tables from algorithmic complexity attacks with resource burning
- On the number of restricted solutions to constrained systems and their applications
- Trusted scalable SAT solving with on-the-fly LRAT checking
- A note on neutral bits for ARX ciphers from the perspective of BCT
- Variants of Wegman-Carter message authentication code supporting variable tag lengths
- HalftimeHash: modern hashing without 64-bit multipliers or finite fields
This page was built for publication: SipHash: a fast short-input PRF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876955)
