Birthday Attack
Birthday attacks are a class of brute-force techniques used in an attempt to solve a class of cryptographic hash functionproblems. These methods take advantage of functions which, when supplied with a random input, return one of 
equallylikely values. By repeatedly evaluating the function for different inputs, the same output is expected to beobtained after about 
evaluations.
References
RSA Laboratories. ``Question 95. What is a Birthday Attack'' and ``Question 96. How Does the Length of a Hash Value Affect Security?'' http://www.rsa.com/rsalabs/faq/.van Oorschot, P. and Wiener, M. ``A Known Plaintext Attack on Two-Key Triple Encryption.'' In Advances in Cryptology--Eurocrypt '90. New York: Springer-Verlag, pp. 366-377, 1991. Yuval, G. ``How to Swindle Rabin.'' Cryptologia 3, 187-189, Jul. 1979.
- Formula
- Fortunate Prime
- Forward Difference
- Fountain
- Four Coins Problem
- Four-Color Theorem
- Fourier-Bessel Series
- Fourier-Bessel Transform
- Fourier Cosine Series
- Fourier Cosine Transform
- Fourier Integral
- Fourier Matrix
- Fourier-Mellin Integral
- Fourier Series
- Fourier Series--Power Series
- Fourier Series--Right Triangle
- Fourier Series--Square Wave
- Fourier Series--Triangle
- Fourier Series--Triangle Wave
- Fourier Sine Series
- Fourier Sine Transform
- Fourier-Stieltjes Transform
- Fourier Transform
- Fourier Transform--1
- Fourier Transform--Cosine