• KEYED TILLICH - ZEMOR HASH FUNCTION
Abstract
At CRYPTO, 94 Tillich and Zemor proposed a family of hash function based on computing a suitable matrix product in groups of the form SL2 (F2n).But Markus Grassl, Ivana Illich, Spyros Magliveras and Rainer Steinwadt found collision for the same between palindrome bit strings of length 2n+2.We construct a keyed hash function by using the same generators of Tillich-Zemor hash function, which resists the palindrome collision.
Keywords
Collision, Group, Hash function, Irreducible polynomial, Preimage, Second preimage.
Full Text:
PDFRefbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2011-2024 Research Journal of Pure Algebra (RJPA) Copyright Agreement & Authorship Responsibility | Counter |