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
Variants
Birthday Attack
22
On the Practical (In-)Security of 64-bit Block Ciphers
Karthikeyan Bhargavan, Gaëtan Leurent · 2016 · 139 citations · Full text
Improved Generalized Birthday Attack.
Paul Kirchner · IACR Cryptology ePrint Archive · 2011 · 60 citations
Collisions of SHA-0 and Reduced SHA-1
Eli Biham, Rafi Chen, Antoine Joux et al. · 2005 · 52 citations
1–5 of 22
50
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 50
25
Universidade de São Paulo
São Paulo, Brazil
4 h-index
15 publications
731 citations
LG (United States)
Englewood Cliffs, United States
2 h-index
2 publications
57 citations
KU Leuven
Leuven, Belgium
2 h-index
5 publications
179 citations
University of Chicago
Chicago, United States
1 h-index
1 publications
12 citations
CryptoExperts (France)
Paris, France
1 h-index
1 publications
139 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
2 publications
20 citations

Fund for Scientific Research
Brussels, Belgium
1 h-index
1 publications
43 citations

University of Wisconsin–Milwaukee
Milwaukee, United States
1 h-index
1 publications
10 citations
1–8 of 25
Repository · 4 publications · 113 citations
4
h-index
1 publications · 12 citations
1
h-index
Conference · 1 publications · 61 citations
1
h-index
1 publications · 120 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5