AI Chat AI Image Generator AI Video Text to Speech

HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields

04/18/2021

∙

by Jim Apple, et al.

∙

∙

HalftimeHash is a new algorithm for hashing long strings. The goals are few collisions (different inputs that produce identical output hash values) and high performance. Compared to the fastest universal hash functions on long strings (clhash and UMASH) HalftimeHash decreases collision probability while also increasing performance by over 50 HalftimeHash does not use any widening 64-bit multiplications or any finite field arithmetic that could limit its portability.

page 1

page 2

page 3

page 4

research

∙ 08/19/2020

The Power of Hashing with Mersenne Primes

The classic way of computing a k-universal hash function is to use a ran...

0 Thomas Dybdahl Ahle, et al. ∙

research

∙ 11/18/2020

Adversarial collision attacks on image hashing functions

Hashing images with a perceptual algorithm is a common approach to solvi...

0 Brian Dolhansky, et al. ∙

research

∙ 05/06/2021

Hashing Modulo Alpha-Equivalence

In many applications one wants to identify identical subtrees of a progr...

0 Krzysztof Maziarz, et al. ∙

research

∙ 09/25/2018

Collaborative Learning for Extremely Low Bit Asymmetric Hashing

Extremely low bit (e.g., 4-bit) hashing is in high demand for retrieval ...

0 Yadan Luo, et al. ∙

research

∙ 09/14/2021

QKD parameter estimation by two-universal hashing leads to faster convergence to the asymptotic rate

This paper proposes and proves security of a QKD protocol which uses two...

0 Dimiter Ostrev, et al. ∙

research

∙ 12/05/2017

Arithmetic Progression Hypergraphs: Examining the Second Moment Method

In many data structure settings, it has been shown that using "double ha...

0 Michael Mitzenmacher, et al. ∙

research

∙ 11/24/2015

Approximate Probabilistic Inference via Word-Level Counting

Hashing-based model counting has emerged as a promising approach for lar...

0 Supratik Chakraborty, et al. ∙