Non-detectable patterns hidden within sequences of bits

Author(s): David Allen1, Jose La Luz2, Guarionex Salivia3, Jonathan Hardwick4
1 Department of Mathematics BMCC, CUNY, New York, New York 10007
2Departmento de Matem\’aticas, Universidad de Puerto Rico, Industrial Minillas 170 Carr 174, Bayam\’on, PR, 00959-1919
3Department of Mathematics, Computer Science and Statistics, Gustavus Adolphus College, 800 West College Avenue Saint Peter, MN 56082
4Department of Computer Information Science, Minnesota state University, Mankato, South Rd and Ellis Ave, Mankato, MN 56001
Copyright © David Allen, Jose La Luz, Guarionex Salivia, Jonathan Hardwick. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

In this paper we construct families of bit sequences using combinatorial methods. Each sequence is derived by converting a collection of numbers encoding certain combinatorial numerics from objects exhibiting symmetry in various dimensions. Using the algorithms first described in [1] we show that the NIST testing suite described in publication 800-22 does not detect these symmetries hidden within these sequences.

Keywords: Cryptography; Pseudo-random number generator; \(f\)-vector; \(h\)-vector; Combinatorial Cryptology; Bit sequences; NIST