Birthday Attacks

Birthday Attacks is a cryptographic attack method that exploits the probabilistic nature of hash collisions in hash functions, wherein an attacker finds two distinct inputs producing the same hash output with a significantly lower effort than brute force by leveraging the mathematical principles of the birthday paradox.

22

Publications

750

Citations

50

Authors

25

Institutions

Publications per year

2017–2026

4

Authors

50

  1. VR
    Vincent Rijmen

    KU Leuven, Belgium

    2 publications · 163 citations

    2

    h-index

  2. MS
    Marcos Silva

    Universidade de São Paulo, Brazil

    2 publications · 57 citations

    2

    h-index

  3. SL
    Shiguo Lian

    Orange (France), France

    2 publications · 36 citations

    2

    h-index

  4. EL
    Eduardo Lopes Cominetti

    LG (United States), United States

    2 publications · 57 citations

    2

    h-index

  5. PS
    Paulo S. L. M. Barreto

    Universidade de São Paulo, Brazil

    2 publications · 163 citations

    2

    h-index

1–5 of 50

Venues

  1. IACR Cryptology ePrint Archive

    Repository · 4 publications · 113 citations

    4

    h-index

  2. The American Statistician

    1 publications · 12 citations

    1

    h-index

  3. Theory and Application of Cryptographic Techniques

    Conference · 1 publications · 61 citations

    1

    h-index

  4. 1

    h-index

  5. 1

    h-index

1–5