AWhat changed
SipHash combines a compact keyed ARX construction with fast short-input processing and an explicit PRF security goal for message authentication and secret-key hash-table defenses.
Scientific scope
SipHash combines a compact keyed ARX construction with fast short-input processing and an explicit PRF security goal for message authentication and secret-key hash-table defenses. SipHash is a keyed short-input pseudorandom-function/MAC design, not a collision-resistant unkeyed hash or password-hashing scheme. The default SipHash-2-4 and more conservative SipHash-4-8 have different round counts. Security is limited by the 128-bit key and 64-bit output, and assumes no key/state leakage or related-key access. The paper offers cryptanalytic evidence and stated expectations, not a proof that every variant is unbreakable. WRS has not independently replayed the attacks or benchmarks, and this historical entry is not current deployment guidance.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- Jean-Philippe Aumasson; Daniel J. Bernstein · SCIENCE: Complete original scientific byline; individual effort fractions are not inferred.
- Wegman and Carter; earlier MAC/BLAKE/Skein/JH contributors · SCIENCE: Acknowledged antecedents and design influences, distinct from this paper's coauthors.
- Samuel Neves; Gaetan Leurent · INFRASTRUCTURE: Optimized implementation and ARX toolkit support identified by the source, distinct from coauthor credit.
- NSF grant1018836 · PARTICIPATION: Funding support does not confer ownership of subsequent scientific work.
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction