Abstract:

The paper considers a method of the construction of the iterated hash function on the bases of the data-dependent lookup operations used previously in the design of the fast software suitable ciphers. To transform encryption function into a block one-way function we use the data-dependent initial condition at each transformation cycle of the round function except the first cycle. The variable initial conditions has been also used to strengthen chaining while constructing the iterated hash function. While fixing initial condition the round function can be transformed into a block cipher suitable to perform fast disk encryption. The size of the input data block of the round function and of the block cipher is parameterized defining their suitability for different practical applications.

Keywords: