EPC : A Provably Secure Permutation Based Compression Function

スポンサーリンク

概要

• 論文の詳細を見る

• The security of permutation-based hash functions in the ideal permutation model has been studied when the input-length of compression function is larger than the input-length of the permutation function. In this paper, we consider permutation based compression functions that have input lengths shorter than that of the permutation. Under this assumption, we propose a permutation based compression function and prove its security with respect to collision and (second) preimage attacks in the ideal permutation model. The proposed compression function can be seen as a generalization of the compression function of MD6 hash function.

• （社）電子情報通信学会の論文
• 2010-10-01

著者

• BAGHERI Nasour

  Electrical Engineering Department of Iran University of Science and Technology

• NADERI Majid

  Electrical Engineering Department of Iran University of Science and Technology

• GAURAVARAM Praveen

  Department of Mathematics of Technical University of Denmark

• SADEGHIYAN Babak

  Department of Computer Engineering of Amirkabir University of Technology

• Sadeghiyan Babak

  Department Of Computer Engineering And Information Technology Amirkabir University Of Technology

関連論文

• Hash Functions and Information Theoretic Security
• Hash Functions and Information Theoretic Security
• EPC : A Provably Secure Permutation Based Compression Function
• A Study of Multiple Characteristics Differential Cryptanalysis

スポンサーリンク