Hamsi-based parametrized family of hash-functions

In this paper a new family of cryptographic hash-functions is described. The main goal was to create a such hash function, where algorithm varies depending on hash code length. Hash function Hamsi was taken as basis of a parameterized algorithm. This hash function was analyzed in a different ways. For a linear transformation, whole class of linear transformations with the same branch numbers was defined. For this class were found invariant subspaces. The second part of the analysis was a research of differential attacks on Hamsi compression function. After the analysis of published works, changes were made to compression function. With these changes a parameterized hash function Hansi-\(n\) was described, that produces \(n\) bit of hash code (e.g. 512, 1024, 2048). To find out complexity of different versions of algorithm, the estimation of bitwise operations needed for one compression function evaluation is described. This new hash-functions can be used in a lot of applications, where hash-codes of varying length are needed.