Hashing Modulo Alpha-Equivalence

05/06/2021
by   Krzysztof Maziarz, et al.
0

In many applications one wants to identify identical subtrees of a program syntax tree. This identification should ideally be robust to alpha-renaming of the program, but no existing technique has been shown to achieve this with good efficiency (better than 𝒪(n^2) in expression size). We present a new, asymptotically efficient way to hash modulo alpha-equivalence. A key insight of our method is to use a weak (commutative) hash combiner at exactly one point in the construction, which admits an algorithm with 𝒪(n (log n)^2) time complexity. We prove that the use of the commutative combiner nevertheless yields a strong hash with low collision probability. Numerical benchmarks attest to the asymptotic behaviour of the method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2023

Fast Consistent Hashing in Constant Time

Consistent hashing is a technique that can minimize key remapping when t...
research
04/18/2021

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

HalftimeHash is a new algorithm for hashing long strings. The goals are ...
research
04/30/2021

Compactness of Hashing Modes and Efficiency beyond Merkle Tree

We revisit the classical problem of designing optimally efficient crypto...
research
08/31/2018

A Formula That Generates Hash Collisions

We present an explicit formula that produces hash collisions for the Mer...
research
03/30/2023

Fuzzified advanced robust hashes for identification of digital and physical objects

With the rising numbers for IoT objects, it is becoming easier to penetr...
research
09/23/2022

Analysis of the new standard hash function

On 2^nd October 2012 the NIST (National Institute of Standards and Techn...
research
03/08/2023

Arion: Arithmetization-Oriented Permutation and Hashing from Generalized Triangular Dynamical Systems

In this paper we propose the (keyed) permutation Arion and the hash func...

Please sign up or login with your details

Forgot password? Click here to reset