Pseudorandom Tableau Sequences

This paper proposes a new class of random sequences called binary primes tableau (BPT) sequences that have potential applications in cryptography and communications. The BPT sequence of rank p is obtained from numbers arranged in a tableau with p columns where primes are marked off until each column has at least one prime and where the column entries are added modulo 2. We also examine the dual to the BPT sequence obtained by adding the rows of the tableau. It is shown that BPT sequences have excellent autocorrelation properties. In the general case, the starting number of the tableau sequence may be arbitrary, which increases the complexity of the sequence.