Hash Function Compression Functions

Hash Function Compression Functions is a cryptographic transformation within the class of hash functions that reduces variable-length input to a fixed-length output by iteratively processing message blocks through a deterministic, one-way compression algorithm, distinguishing it from other hash constructions by its reliance on repeated application of a core compression function to achieve collision resistance and preimage security.

57

Publications

2.7K

Citations

132

Authors

53

Institutions

Publications per year

2017–2026

6

Authors

132

  1. BP
    Bart Preneel

    KU Leuven, Belgium

    3 publications · 78 citations

    3

    h-index

  2. DK
    Daesung Kwon

    Electronics and Telecommunications Research Institute, South Korea

    3 publications · 66 citations

    3

    h-index

  3. BM
    Bart Mennink

    Radboud University Nijmegen, Netherlands

    3 publications · 56 citations

    3

    h-index

  4. DH
    Deukjo Hong

    Korea University, South Korea

    3 publications · 40 citations

    3

    h-index

  5. JL
    Jooyoung Lee

    Korea Advanced Institute of Science and Technology, South Korea

    3 publications · 74 citations

    3

    h-index

1–5 of 132

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 12 publications · 444 citations

    10

    h-index

  2. 4

    h-index

  3. IEEE Transactions on Information Theory

    3 publications · 112 citations

    3

    h-index

  4. IEEE Access

    2 publications · 55 citations

    2

    h-index

  5. IET Information Security

    1 publications · 11 citations

    2

    h-index

1–5