EPC: a provably secure permutation based compression function
Data(s) |
01/10/2010
|
---|---|
Resumo |
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. |
Identificador | |
Publicador |
Denshi Jouhou Tsuushin Gakkai,Institute of Electronics Information and Communication Engineers |
Relação |
http://search.ieice.org/bin/summary.php?id=e93-a_10_1833 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. |
Direitos |
Copyright 2010 Denshi Jouhou Tsuushin Gakkai, Institute of Electronics Information and Communication Engineers |
Fonte |
School of Electrical Engineering & Computer Science; Science & Engineering Faculty |
Tipo |
Journal Article |