From Wikipedia, the free encyclopedia

In cryptography and the theory of computation, the next-bit test [1] is a test against pseudo-random number generators. We say that a sequence of bits passes the next bit test for at any position in the sequence, if an attacker knows the first bits, he cannot predict the st with reasonnable computational power.

Precise statement Information

Completeness for Yao's test Information

  1. ^ Andrew Chi-Chih Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982.
From Wikipedia, the free encyclopedia

In cryptography and the theory of computation, the next-bit test [1] is a test against pseudo-random number generators. We say that a sequence of bits passes the next bit test for at any position in the sequence, if an attacker knows the first bits, he cannot predict the st with reasonnable computational power.

Precise statement Information

Completeness for Yao's test Information

  1. ^ Andrew Chi-Chih Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982.

Videos

Youtube | Vimeo | Bing

Websites

Google | Yahoo | Bing

Encyclopedia

Google | Yahoo | Bing

Facebook