New answers tagged

0

A deterministic random bit generator is, per standard terminology, a pseudo-random generator. That is defined¹ to be a deterministic polynomial-time algorithm $G$ with associated polynomial $l$ (it's length expansion factor), implementing a function $G:\{0,1\}^*\to\{0,1\}^*$ such that For all input $s$ it holds $\mathbin\|G(s)\mathbin\|=l(\mathbin\|s\...


0

Deterministic random bit generator is a function that takes as input a secret seed and possibly other inputs and produces (long) strings of output bits with the following property: for all adversaries with (polynomially) bounded computational power, the distribution of output bits is indistinguishable from a uniform, independent distribution of bits. I don'...


Top 50 recent answers are included