Based on the Two Trails of RIPEMD Efficient, Especially on Short Messages and for Frequent Key-Changes
暂无分享,去创建一个
We present a new message authentication code. It is based on a two trail construction, which underlies the unkeyed hash func- tion RIPEMD-160. It is in comparison with the MDx-MAC based on RIPEMD-160, much more efficient on short messages (that is on mes- sages of 512 or 1024 bits) and percentage-wise a little bit more efficient on long messages. Moreover, it handles key-changes very efficiently. This positive fact remains if we compare our Two-Track-MAC with HMAC based on RIPEMD-160.
[1] Gene Tsudik,et al. Message authentication with one-way hash functions , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.