Vampyr, on 2016-September-16, 11:31, said:
Can someone explain to me exactly how boards can be predicted? If you have the seed, how exactly does one board relate to the next?
There are at least two ways to implement this attack.
First of all, given modern computer resources, the search space is relative small.
The simplest attack is for me to enumerate the output of the hand generator for every possible seed.
I build a rainbow table and we're off to the races.
A slightly more complicated attack is to take advantage of the flawed nature of the LCG being used to generate random numbers
"LCGs should not be used for applications where high-quality randomness is critical. For example, it is not suitable for a Monte Carlo simulation because of the serial correlation (among other things). They also must not be used for cryptographic applications; see cryptographically secure pseudo-random number generator for more suitable generators. If a linear congruential generator is seeded with a character and then iterated once, the result is a simple classical cipher called an affine cipher; this cipher is easily broken by standard frequency analysis.
LCGs tend to exhibit some severe defects. For instance, if an LCG is used to choose points in an n-dimensional space, the points will lie on, at most, (n!m)1/n hyperplanes (Marsaglia's Theorem, developed by George Marsaglia). This is due to serial correlation between successive values of the sequence Xn. The spectral test, which is a simple test of an LCG's quality, is based on this fact."