Functions with Diffusive Properties
This work addresses a theoretical problem in cryptography for designing secure hash functions, but it appears incremental as it builds on known concepts of diffusion without claiming broad practical impact.
The paper tackled the problem of constructing functions with diffusive properties for cryptographic hash functions by investigating three notions of diffusion based on Hamming distances in hypercube structures, and it explicitly constructed such functions for all feasible output dimensions given the input dimension.
While exploring desirable properties of hash functions in cryptography, the author was led to investigate three notions of functions with scattering or "diffusive" properties, where the functions map between binary strings of fixed finite length. These notions of diffusion ask for some property to be fulfilled by the Hamming distances between outputs corresponding to pairs of inputs that lie on the endpoints of edges of an $n$-dimensional hypercube. Given the dimension of the input space, we explicitly construct such functions for every dimension of the output space that allows for the functions to exist.