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

DOI10.1007/978-3-030-83508-8_8MaRDI QIDQ832844zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 6351507 (Why is no real title available?)
• scientific article; zbMATH DE number 1418297 (Why is no real title available?)
• scientific article; zbMATH DE number 1418345 (Why is no real title available?)
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• Badger – A Fast and Provably Secure MAC
• Cuckoo hashing
• Fast Software Encryption
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Linear hash functions
• On the Minimum Number of Multiplications Necessary for Universal Hash Functions
• SipHash: a fast short-input PRF
• String hashing for linear probing
• Theory of Cryptography
• Universal Hashing via Integer Arithmetic Without Primes, Revisited
• Universal classes of hash functions

Describes a project that uses

Uses Software

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

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)