Generalize the randomness tests to test the digital sequences produced from digital stream cipher systems

الملخص EN

In this paper, first, the Golomb’s postulates are generalized to construct a good mathematical base, and then generalize the binary standard randomness tests to be suitable to be applied on digital sequences.

This paper includes some tables describe the tests results of the digital sequences generated from some digital generators, like the Multiplicative Cyclic Group System (MCGS) generator.