The birthday attacks are called so because we can only have 365 birthdays (oh well, excluding 2/29). So, if there are 366 people in a place at least two of them have the same birthday - thus causing collision(s). Same things happens in hash algorithm. The people in birthday attack is the same thing as:. 1. hash in the hash algorithm. 2. input in the hash algorithm. 3. the algorithm in hash algorithm. 4. the key

2. input in the hash algorithm

In a hash algorithm, a function called hash function (say H) is chosen to transform a variable sized input n, and return a fixed size string called the hash value (say h). i.e

H(n) => h

Comparing this to the birthday attacks;

i. the hash function is getting the people's birthdays - H,

ii. the input is each person in the group of people - n,

iii. the hash is the value of the birthday of each person - H(n).

answer///radio frequency interference (rfi);

answerdmz;