HalftimeHash: modern hashing without 64-bit multipliers or finite fields

DOI10.1007/978-3-030-83508-8_8OpenAlexW3194514344MaRDI QIDQ832844FDOQ832844

Jim Apple

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2104.08865

zbMATH Keywords

randomized algorithmsuniversal hashing

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites Work

• Fast Software Encryption
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• Universal classes of hash functions
• Theory of Cryptography
• Cuckoo hashing
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Minimum Number of Multiplications Necessary for Universal Hash Functions
• SipHash: A Fast Short-Input PRF
• Linear hash functions
• Title not available (Why is that?)
• Badger – A Fast and Provably Secure MAC
• Title not available (Why is that?)
• Universal Hashing via Integer Arithmetic Without Primes, Revisited

Uses Software

• Chord
• SipHash
• NaCl
• Poly1305-AES
• GitHub

This page was built for publication: HalftimeHash: modern hashing without 64-bit multipliers or finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832844)