New answers tagged cryptanalysis
Another method of solving for m comes from this paper. Essentially, this method exploits the fact that the linear congruential generator dramatically fails the planes test. The determinant of a 3x3 matrix using 4 outputs is a multiple of m. The gcd of two multiples (n_1 and n_2 of m is m if x_1 = n_1/m and x_2 = n_2/m are co-prime. The probability that k ...
Top 50 recent answers are included