A Keyed Hash Function

Abstract

: We constructed a hash function by using the idea of cayley graph, hash function based on computing a suitable matrix product in groups of the form SL 2 (F 2 n ). We found collision between palindrome bit strings of length 2n+2 for the new construction. Here we reinforce the hash function by adding key to it and we claim that it will resists palindrome collision.