Yao's Test
Versandkostenfrei!
Versandfertig in 6-10 Tagen
19,99 €
inkl. MwSt.
PAYBACK Punkte
10 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In cryptography and the theory of computation, Yao''s test is a test defined by Andrew Chi-Chih Yao in 1982, against pseudo-random sequences. A sequence of words passes Yao''s test if an attacker with reasonable computational power cannot distinguish it from a sequence generated uniformly at random. As in the case of the next-bit test, the predicting collection used in the above definition can be replaced by a probabilistic Turing machine, working in polynomial time. ...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In cryptography and the theory of computation, Yao''s test is a test defined by Andrew Chi-Chih Yao in 1982, against pseudo-random sequences. A sequence of words passes Yao''s test if an attacker with reasonable computational power cannot distinguish it from a sequence generated uniformly at random. As in the case of the next-bit test, the predicting collection used in the above definition can be replaced by a probabilistic Turing machine, working in polynomial time. This also yields a strictly stronger definition of Yao''s test (see Adleman''s theorem). Indeed, One could decide undecidable properties of the pseudo-random sequence with the non-uniform circuits described above, whereas BPP machines can always be simulated by exponential-time deterministic Turing machines.
Andere Kunden interessierten sich für
