Abstract
We propose a new family of hash functions based on computations over a finite
field of characteristic 2. These functions can be computed quickly, detect
small modifications of the input text, and their security is equivalent to
a precise mathematical problem. They rely on the arithmetic of the group
of matrices SL2, and improve upon previous functions based on the same strategy.
