タイトル(掲載誌)IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
一般注記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.
一次資料へのリンクURLhttps://u-fukui.repo.nii.ac.jp/?action=repository_action_common_download&item_id=22952&item_no=1&attribute_id=22&file_no=1
著作権情報Copyright 〓 2006 The Institute of Electronics, Information and Communication Engineers
連携機関・データベース国立情報学研究所 : 学術機関リポジトリデータベース(IRDB)(機関リポジトリ)