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

Authors

1.4K

  1. DX
    Di Xiao

    Chongqing University, China

    15 publications · 900 citations

    13

    h-index

  2. BP
    Bart Preneel

    KU Leuven, Belgium

    14 publications · 817 citations

    13

    h-index

  3. CR
    Christian Rechberger

    Graz University of Technology, Austria

    12 publications · 412 citations

    12

    h-index

  4. YL
    Yantao Li

    Chongqing University, China

    12 publications · 501 citations

    11

    h-index

  5. HE
    Harris E. Michail

    University of Patras, Greece

    11 publications · 273 citations

    10

    h-index

1–5 of 1.4K

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 41 publications · 1.6K citations

    19

    h-index

  2. Multimedia Tools and Applications

    16 publications · 786 citations

    16

    h-index

  3. Designs Codes and Cryptography

    15 publications · 554 citations

    13

    h-index

  4. IEEE Access

    14 publications · 410 citations

    12

    h-index

  5. Journal of Cryptology

    12 publications · 896 citations

    11

    h-index

1–5