Practical Next Bit Test for Evaluating Pseudorandom Sequences.

The next bit test brie y states that a sequence is random if and only if, given any i bits of the sequence, it is not possible to predict the next bit of the sequence with a probability of success signi cantly greater than 1/2. in 1996, sadeghiyan and mohajeri proposed a so-called new universal test for bit strings, based on the theoretical next bit test. in this paper, we study di erent aspects of this test and show its weakness. then, we improve it both theoretically and practically for better classi cation of the sequences. as a result, a practical next bit (pnb) test is introduced in two global and local versions and a histogram, which gives an impression of the global evaluation of the underlying sequence. testing samples of nonrandom sequences, using both the pnb test and the nist statistical test suite, indicates the superiority of the pnb test power over that of the nist.