Section 8.4 deals with the concept of Birthday attacks, which were briefly mentioned in the beginning of chapter 7 when introducing discrete logarithms and are also mentioned in chapter 9 (I did some perusing). At first glance birthday attacks seem like a counter intuitive notion, but the statistics behind them is remarkably simple. It just utilizes the probability of something not happening (the probability of not having the same birthday as someone else) over and over. The notion is made much less counter-intuitive when it is presented as the probability that any two units in a set n can match rather than checking if any of the units from set n match a particular unit of set n. The latter is the view that is probably intuitively understood, but when described appropriately it is easy to comprehend.
The birthday attacks' relevance to cryptology is not immediately apparent, but it can be used as a way of attacking discrete logarithms (by checking for matches between groups probabalistically) and, thanks to the perusing, it is also mentioned with regard to digital signatures. Unfortunately for the enthused, the Baby step Giant step algorithm is superior to a birthday attack for all intents and purposes regarding discrete logarithms, but as will presumably be seen, the birthday attack does have other uses including an interesting "did you know" amongst friends.
No comments:
Post a Comment