EPC: A Provably Secure Permutation Based Compression Function

Nasour BAGHERI  Praveen GAURAVARAM  Majid NADERI  Babak SADEGHIYAN  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E93-A   No.10   pp.1833-1836
Publication Date: 2010/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E93.A.1833
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Cryptography and Information Security
Keyword: 
compression function,  MD6,  permutation,  SHA3,  

Full Text: PDF(166.8KB)>>
Buy this Article




Summary: 
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.