Reconstructing noisy polynomial evaluation in residue rings
Journal of Algorithms
A lightweight secure protocol for wireless sensor networks
Computer Communications
On pseudorandom numbers from multivariate polynomial systems
Finite Fields and Their Applications
Predicting masked linear pseudorandom number generators over finite fields
Designs, Codes and Cryptography
| Hi-index | 754.84 |
It is shown that the multiplier, the increment, and the seed value of a linear congruential random number generator on a binary computer can be deduced from the leading bits of the "random" numbers that are generated.