Binary Prime Tableau Sequences
This addresses the need for sequences with good autocorrelation in cryptography and communications, but it appears incremental as it builds on existing prime-based methods.
The paper introduces binary prime tableau (PT) sequences, a new class of random sequences derived from primes arranged in a tableau with modulo 2 addition, and shows they have excellent autocorrelation properties.
This paper proposes a new class of random sequences called binary primes tableau (PT) sequences that have potential applications in cryptography and communications. The PT 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 PT sequences obtained by adding the rows of the tableau. It is shown that PT sequences have excellent autocorrelation properties.