![]() Many so-called random number generators, such as those based on linear feedback shift registers (LFSR) or linear congruences, are not cryptographically secure, as it is possible to predict the sequence from a short prefix of the sequence. In particular, given a short prefix of the sequence, it should be computationally infeasible to predict the rest of the sequence without knowing the seed. Wright, in Encyclopedia of Physical Science and Technology (Third Edition), 2003 IV.B Pseudorandom Number GeneratorsĪ pseudorandom number generator is a function that takes a short random seed and outputs a longer bit sequence that “appears random.” To be cryptographically secure, the output of a pseudorandom number generator should be computationally indistinguishable from a random string. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |