TY - JOUR
ID - 3221
TI - Practical Next Bit Test for Evaluating Pseudorandom Sequences
JO - Scientia Iranica
JA - SCI
LA - en
SN - 1026-3098
AU - Lavasani, A.
AU - Eghlidos, T.
AD - Department of Mathematical Sciences,Sharif University of Technology
Y1 - 2009
PY - 2009
VL - 16
IS - 1
SP -
EP -
KW - Next bit test
KW - Random sequences
KW - Statistical test
DO -
N2 - Abstract. 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
signicantly 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 dierent aspects of this test
and show its weakness. Then, we improve it both theoretically and practically for better classication 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.
UR - http://scientiairanica.sharif.edu/article_3221.html
L1 - http://scientiairanica.sharif.edu/article_3221_dd0d62aa568632f4dab599ecfbdf5c8b.pdf
ER -