Hash Function Design
Hash Function Design is a scholarly contribution in the field of cryptography that specifies the methodological framework for constructing deterministic algorithms mapping arbitrary-length inputs to fixed-length outputs, distinguished by its focus on achieving essential security properties such as preimage resistance, second preimage resistance, and collision resistance within the context of cryptographic hashing and hash table applications.
675
Publications
33.6K
Citations
1.4K
Authors
539
Institutions
Publications per year
2017–2026
138
675
Universal classes of hash functions
J.Lawrence Carter, Mark N. Wegman · Journal of Computer and System Sciences · 1979 · 2.6K citations
Universal one-way hash functions and their cryptographic applications
Ramarathnam Venkatesan, S.-M. Koon, Mariusz Jakubowski et al. · 2002 · 494 citations
Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD
Xiaoyun Wang, Dengguo Feng, Xuejia Lai et al. · IACR Cryptology ePrint Archive · 2004 · 458 citations
1–5 of 675
1.4K
13
h-index
13
h-index
12
h-index
11
h-index
10
h-index
1–5 of 1.4K
539

Chongqing University
Chongqing, China
18 h-index
63 publications
3.2K citations
KU Leuven
Leuven, Belgium
15 h-index
41 publications
1.5K citations
Graz University of Technology
Graz, Austria
13 h-index
36 publications
1.1K citations
University of Patras
Pátrai, Greece
12 h-index
41 publications
1K citations

University of Waterloo
Waterloo, Canada
11 h-index
23 publications
942 citations

Indian Statistical Institute
Kolkata, India
10 h-index
20 publications
477 citations

Centre National de la Recherche Scientifique
Paris, France
9 h-index
17 publications
1.2K citations

Universiti Sains Malaysia
George Town, Malaysia
8 h-index
26 publications
1.1K citations
1–8 of 539
Repository · 41 publications · 1.6K citations
19
h-index
16 publications · 786 citations
16
h-index
15 publications · 554 citations
13
h-index
14 publications · 410 citations
12
h-index
12 publications · 896 citations
11
h-index
1–5