EPC: a provably secure permutation based compression function
Bagheri, Nasour, Gauravaram, Praveen, Naderi, Majid, & Sadeghiyan, Babak (2010) EPC: a provably secure permutation based compression function. IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences, E93-A(10), pp. 1833-1836.
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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Divisions:||Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
|Copyright Owner:||Copyright 2010 Denshi Jouhou Tsuushin Gakkai, Institute of Electronics Information and Communication Engineers|
|Deposited On:||05 Feb 2015 01:52|
|Last Modified:||10 Feb 2015 05:02|
Repository Staff Only: item control page