« first day (2142 days earlier)   

7:32 AM
I have noticed the past discussion about tag - since it was linked as an example in the recently bumped post about (tag-removed).
19
Q: The birthday tag

John MaRecently the birthday tag has emerged and it quickly has around 100 questions tagged (mainly by one user I suppose). This is indeed not the first time we have this tag. The last time it was deleted and another tag calendar-computations was introduced. My concern is probably naive since my und...

The tag has both tag-excerpt and tag-wiki.
In the discussion there were several suggestions how the tag should be renamed. In fact, I have copied some of the comments that seemed interesting also in this room.
But it seems that the issue still remains unresolved.
The tag [tag;birthday] has currently 135 questions. (In November, at the time when the question on meta was posted, it was approximately 100 questions. Since Henry got Taxonomist badge for this tag on November 17, it must have been at least 100 questions at that point.)
 
 
1 hour later…
8:39 AM
From the suggestions in the comments, sounds quite reasonable to me.
Both Birthday problem and Birthday attack were mentioned in the discussion.
In probability theory, the birthday problem or birthday paradox concerns the probability that, in a set of n randomly chosen people, some pair of them will have the same birthday. 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). However, 99.9% probability is reached with just 70 people, and 50% probability with 23 people. These conclusions are based on the assumption that each day of the year (excluding February 29) is equally probable for a birthday. Real-world applications for...
A birthday attack is a type of cryptographic attack that exploits the mathematics behind the birthday problem in probability theory. This attack can be used to abuse communication between two or more parties. The attack depends on the higher likelihood of collisions found between random attack attempts and a fixed degree of permutations (pigeonholes). With a birthday attack, it is possible to find a collision of a hash function in 2 n = ...
 

« first day (2142 days earlier)