Cryptographic Hashing

Cryptographic Hashing is a deterministic algorithmic process that belongs to the class of cryptographic functions and is distinguished by its ability to transform arbitrary-length input into a fixed-length, unique output such that any change to the input infeasibly alters the output, ensuring data integrity and collision resistance.

1.9K

Publications

98.9K

Citations

4.2K

Authors

1.3K

Institutions

Publications per year

2017–2026

650

Authors

4.2K

  1. BP
    Bart Preneel

    KU Leuven, Belgium

    19 publications · 1K citations

    14

    h-index

  2. DX
    Di Xiao

    Chongqing University, China

    16 publications · 917 citations

    14

    h-index

  3. CR
    Christian Rechberger

    Graz University of Technology, Austria

    16 publications · 528 citations

    14

    h-index

  4. DR
    Douglas R. Stinson

    University of Waterloo, Canada

    13 publications · 1K citations

    13

    h-index

  5. VR
    Vincent Rijmen

    KU Leuven, Belgium

    13 publications · 457 citations

    12

    h-index

1–5 of 4.2K

Venues

  1. Proceedings of the National Academy of Sciences

    PNAS · 51 publications · 3.7K citations

    32

    h-index

  2. IACR Cryptology ePrint Archive

    Repository · 97 publications · 3K citations

    28

    h-index

  3. IEEE Access

    53 publications · 2.2K citations

    27

    h-index

  4. Journal of Cryptology

    24 publications · 1.8K citations

    19

    h-index

  5. 19

    h-index

1–5