![]() It is not known whether good pseudorandom generators for this class exist, but it is known that their existence is in a certain sense equivalent to (unproven) circuit lower bounds in computational complexity theory. Many different classes of statistical tests have been considered in the literature, among them the class of all Boolean circuits of a given size. The random seed itself is typically a short binary string drawn from the uniform distribution. ![]() In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps a random seed to a longer pseudorandom string such that no statistical test in the class can distinguish between the output of the generator and the uniform distribution. For the common meaning of this term, see Pseudorandom number generator. This page is about the formal concept in theoretical computer science.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |