A Security Analysis of Double-Block-Length Hash Functions with the Rate 1

スポンサーリンク

概要

• 論文の詳細を見る

• In this article, the security of double-block-length hash functions with the rate 1 is analyzed, whose compression functions are composed of block ciphers with their key length twice larger than their block length. First, the analysis by Satoh, Haga and Kurosawa is investigated, and it is shown that there exists a case uncovered by their analysis. Second, a large class of compression functions are defined, and it is shown that they are at most as secure as those of single-block-length hash functions. Finally, some candidate hash functions are given which are possibly optimally collision-resistant.

• 社団法人電子情報通信学会の論文
• 2006-10-01

著者

• Hirose Shoichi

  Univ. Fukui Fukui‐shi Jpn

• Hirose Shoichi

  Faculty Of Engineering The University Of Fukui

関連論文

• Complexity of Differential Attacks on SHA-0 with Various Message Schedules(Information Security)
• A Security Analysis of Double-Block-Length Hash Functions with the Rate 1

スポンサーリンク