An Improved Hash Function Based on the Tillich-Zémor Hash Function

Abstract

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

Keywords

• the tillich-zemor hash function
• cayley hash function
• special linear group