How to Construct Pseudorandom Bit Sequences from Mazes by a Method Digging Out Walls

Abstract

In this paper, we propose a new pseudorandom bit sequence generator, which is based on a method digging out walls. Although each of these sequences lacks enough randomness, synthesized sequences of them can pass all of the NIST statistical test suite. We also describe a conjectural relation between the number of types on the square mazes and their sizes.