EPC: A Provably Secure Permutation Based Compression Function

Nasour Bagheri, Praveen Gauravaram, Majid Naderi, Babak Sadeghiyan

    Research output: Contribution to journalJournal articleResearchpeer-review


    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.
    Original languageEnglish
    JournalI E I C E Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    Issue number10
    Pages (from-to)1833-1836
    Publication statusPublished - 2010


    • Compression function
    • MD6
    • SHA3
    • Permutation


    Dive into the research topics of 'EPC: A Provably Secure Permutation Based Compression Function'. Together they form a unique fingerprint.

    Cite this