Please use this identifier to cite or link to this item:
|Title:||Cryptanalysis of the Tillich-Zémor hash function|
|Authors:||Grassl, M. |
|Source:||Grassl, M., Ilić, I., Magliveras, S., Steinwandt, R. (2011-01). Cryptanalysis of the Tillich-Zémor hash function. Journal of Cryptology 24 (1) : 148-156. ScholarBank@NUS Repository. https://doi.org/10.1007/s00145-010-9063-0|
|Abstract:||At CRYPTO '94, Tillich and Zémor proposed a family of hash functions, based on computing a suitable matrix product in groups of the form SL 2(ℱ 2n). We show how to construct collisions between palindromic bit strings of length 2n+2 for Tillich and Zémor's construction. The approach also yields collisions for related proposals by Petit et al. from ICECS '08 and CT-RSA '09. It seems fair to consider our attack as practical: for parameters of interest, the colliding bit strings have a length of a few hundred bits and can be found on a standard PC within seconds. © 2010 International Association for Cryptologic Research.|
|Source Title:||Journal of Cryptology|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 22, 2018
WEB OF SCIENCETM
checked on Jan 24, 2018
checked on Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.