• TILLICH-ZEMOR HASH FUNCTION WITH NEW GENERATORS AND ANALYSIS

Abstract

At CRYPTO ’94, Tillich and Zemor proposed a family of hash functions, based on computing a suitable matrix product in groups of the form SL₂(F₂n). Markus  Grassl, Ivana Illich, Spyros Magliveras and Rainer  Steinwandt constructed a collision between palindrome bit strings of length 2n+2 and Christophe Petit, Jean-Jacques Quisquater found the second preimage  for Tillich and Zemor’s construction. In this paper we construct a hash function by using different matrices for the image of the bits 0 and 1 and found the collision and second preimage for the new construction.