What is a hash flood attack (Hash-Flooding Attack)?
A nightclub has 80 sister paper, the first to go when you do not know which sister paper, good-looking, is the type you like, you can put all the sister paper called foreman called out, one by one to see, you can see after selecting a favorite after 80, assuming that each sister paper to see 10 seconds, you will need a total of 800 seconds. Finally selected a sister paper, next to a sister paper also looking for how to do this? This time we will ask you a number of sister paper how much? Sister paper that I was number 68, this is the hash value of the 68 sister paper.
We focus on that second time, the second time to go, you need to remember is the sister paper number (hash value) value of 68 on the line, generally 10 seconds to find the sister paper.
However, I would say, however, some foreman (programmer) more mischievous, he put all the sister paper of the numbers are set to No. 68. When you go to a nightclub he said to the foreman, trouble the sister paper No. 68 called out, this time to the sister paper or 80, because 80 is the sister paper No. 68. This deliberately 80 sister paper called the number 68 is called this behavior Hash collision attacks. Because of his mischievous, resulting in a substantial extension of the customer pick the sister paper of the time, from 10 seconds to 800 seconds.
In the code, in general, some of the more complex algorithms to derive the hash value calculation, once cracked the algorithm, and again be naughty friends.