** Next:** Hard-Core Predicates and Pseudo-Random
** Up:** Blair's Cryptography Notes
** Previous:** The Efficient Test Theorem
** Contents**

The two main results of the preceding section were the Next Bit
Theorem and the Efficient Tests Theorem. The former depended
on (QRA) and facts about squares and pseudo-squares. The latter
was an abstract result about properties of arbitrary generators.
Our first result is an abstract version of the Next Bit Theorem.

**Subsections**

*Translated from LaTeX by Scott Sutherland *

2002-12-14