Sciweavers

Share
IACR
2016

Compositions of linear functions and applications to hashing

5 years 6 months ago
Compositions of linear functions and applications to hashing
Cayley hash functions are based on a simple idea of using a pair of (semi)group elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the (semi)group. In this paper, we focus on hashing with linear functions of one variable over Fp. The corresponding hash functions are very efficient. In particular, we show that hashing a bit string of length n with our method requires, in general, at most 2n multiplications in Fp, but with particular pairs of linear functions that we suggest, one does not need to perform any multiplications at all. We also give explicit lower bounds on the length of collisions for hash functions corresponding to these particular pairs of linear functions over Fp.
Vladimir Shpilrain, Bianca Sosnovski
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where IACR
Authors Vladimir Shpilrain, Bianca Sosnovski
Comments (0)
books