作者
B Prencel, Antoon Bosselaers, René Govaerts, Joos Vandewalle
发表日期
1989/10/3
研讨会论文
Proceedings. International Carnahan Conference on Security Technology
页码范围
203-210
出版商
IEEE
简介
The concept of collision free hash functions has been shown to be a useful building block of signature schemes and message authentication schemes. In this paper, a fast and secure proposal is made for a 2n-bit collison free hash function based on an n-bit encryp tion algorithm. In case of the DES, the length of the result is 128 bits, which suffices to thwart a birthday attack.
引用总数
学术搜索中的文章
B Prencel, A Bosselaers, R Govaerts, J Vandewalle - Proceedings. International Carnahan Conference on …, 1989