Computer Science
B. Prencel, A. Bosselaers, R. Govaerts, J. Vandewalle
1989Proceedings - International Carnahan Conference on Security Technology
tlooto Summary
A fast and secure proposal is made for a 2n-bit collison free hash function based on an n-bit encryp tion algorithm, which suffices to thwart a birthday attack in case of the DES.
Abstract
Abstract is not available.
Citation format
PRENCEL, B., et al. Collision-free hashfunctions based on blockcipher algorithms. Proceedings - International Carnahan Conference on Security Technology, 1989: 203–210.