Hi, if I have a sequence of 1000 random numbers generated by a linear congruential generator of the form:
Xn+1=Xn*a+c mod 32
And i know that the 1000 numbers are extracted from the bits 30-16 (15 bits) of the numbers generated with the formula above. (i.e, they range from 0 to 32767).
How can i predict the 10 next numbers, i.e, how can i calculate the a, c and seed(Xo) values?
I know that it is possible, but i don't have access to the next paper, which i think could be very useful:
http://portal.acm.org/citation.cfm?id=66886
Thanks a lot for your help