Algorithm construction of HLI hash function

Abstract

Hash function based on lattices believed to have a strong security proof based on the worst-case hardness, In 2008. Lyubashevsky et al. proposed WSIFFT, aa hash function that corresponds to a simple expresion over modular polynomial ring R = Zp[alfa]/(alfa) n + 1). We construct HLI, a hash function that corresponds to a simple expression over modular polynomial ring Rf,p = Zp[x[/f(x). We choose a monic and irreducible polynomial f(x) = (x)n - x -1 to obtain the hash function is collision resistant. Thus, the number of operatins in hash function is collision resistant. Thus, the number of operations in hash function is calculated and compared with SWIFFT. Thus, the number of operations in hash function is calculated and compared with SWIFFT.