Do you know what the birthday paradox means? And how is it related to cryptography?
Let us tell you!
Thread๐งต๐
Let us tell you!
Thread๐งต๐
In a group of 23 people, the probability of a shared birthday exceeds 50%.
A group of 70 people has a 99.9% chance of a shared birthday.
2/6
A group of 70 people has a 99.9% chance of a shared birthday.
2/6
By the pigeonhole principle, the probability reaches 100% when the number of people reaches 367 since there are only 366 possible birthdays, including February 29.
3/6
3/6
The pigeonhole principle aka Dirichlet's box principle or Dirichlet's drawer principle
states that if n items are put into m containers, with n>m, then at least one container must contain more than one item.
4/6
states that if n items are put into m containers, with n>m, then at least one container must contain more than one item.
4/6
A cryptographic attack called the birthday attack uses the probabilistic model of the birthday problem to reduce the complexity of
1. finding a collision for a hash function
2. calculating the approximate risk of a hash collision
5/6
1. finding a collision for a hash function
2. calculating the approximate risk of a hash collision
5/6
Loading suggestions...