We present a new hash-function, which provides 2n-bit hash-results, using any n-bit symmetric block cipher algorithm. This hash-function can be considered as a extension of an already known one, which only provided n-bit hash-results. The difference is crucial, because a lot of symmetric block cipher algorithms use 64-bit blocks and recent works have shown that a 64-bit hash-result is greatly insufficient.
CITATION STYLE
Quisquater, J. J., & Girault, M. (1990). 2n-bit hash-functions using n-bit symmetric block cipher algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 434 LNCS, pp. 102–109). Springer Verlag. https://doi.org/10.1007/3-540-46885-4_13
Mendeley helps you to discover research relevant for your work.