<会議発表論文>
Attacks for Finding Collision in Reduced Versions of 3-PASS and 4-PASS HAVAL

作成者
本文言語
出版者
発行日
雑誌名
雑誌名
開始ページ
終了ページ
出版タイプ
アクセス権
JaLC DOI
概要 HAVAL is a hash function, which was proposed by Zheng et al. HAVAL has the first flexiable variable output lengths, namely 128, 160, 192, 224 or 256 bits, and consists of 3-pass, 4-pass and 5-pass. Di...fferences of these types are the number of step, permutations order and boolean functions. P. R. Kasselman et al. and Park et al. found collisions of 3-pass HAVAL. In order to find a collision, they used two successive passes of 3-pass. To verify the security of HAVAL, we try to find a collision in two non-successive passes and 4-pass HAVAL. We can evaluate on the security of HAVAL through results of our attack. That is, we can know whether permutations order and boolean functions have an influence on the security of HAVAL or not. For this evaluation, we introduce the scheme of Park et al.続きを見る

本文情報を非表示

yong02_9 pdf 77.4 KB 42  

詳細

レコードID
査読有無
関連情報
主題
タイプ
登録日 2009.04.22
更新日 2017.03.02