Predicting masked linear pseudorandom number generators over finite fields
We study the security of the linear generator over a finite field. It is shown that the seed of a linear generator can be deduced from partial information of a short sequence of consecutive outputs of such generators.
pseudorandom numbers finite fields cryptography