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
Parents
57
Universal one-way hash functions and their cryptographic applications
Jean-Philippe Aumasson, Luca Henzen, Willi Meier et al. · 2008 · 163 citations
On the Power of Quantum Memory
IEEE Transactions on Information Theory · 2005 · 57 citations · Full text
Computing, Computer Science, Physics +15
1–5 of 57
132
3
h-index
Electronics and Telecommunications Research Institute, South Korea
3 publications · 66 citations
3
h-index
3
h-index
3
h-index
Korea Advanced Institute of Science and Technology, South Korea
3 publications · 74 citations
3
h-index
1–5 of 132
53
KU Leuven
Leuven, Belgium
6 h-index
11 publications
445 citations
State Key Laboratory of Cryptology
Beijing, China
4 h-index
6 publications
188 citations
Electronics and Telecommunications Research Institute
Daejeon, South Korea
3 h-index
5 publications
129 citations
Technical University of Denmark
Kongens Lyngby, Denmark
2 h-index
4 publications
159 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
67 citations
Shandong University
Jinan, China
2 h-index
1 publications
11 citations
Tsinghua University
Beijing, China
2 h-index
3 publications
33 citations
Guilin University
Guilin, China
1 h-index
2 publications
34 citations
1–8 of 53
Repository · 12 publications · 444 citations
10
h-index
4 publications · 81 citations
4
h-index
3 publications · 112 citations
3
h-index
2 publications · 55 citations
2
h-index
1 publications · 11 citations
2
h-index
1–5