Testing the Randomness and Using the Digital Sequences of GF(5) in Cryptography

Abstract

In this paper, first, the Golomb’s postulates of randomness are expanded toconstruct a good mathematical base, and then expand the binary standardrandomness tests to be suitable to be applied on penta-sequences this mean theelements of the sequence belong to Galois Field GF(5). Second we will showusefulness of using penta-sequences in cryptography. The paper also includes sometables describe the tests results of the penta-sequences generated from some digitalgenerators, like the Multiplicative Cyclic Group System (MCGS). The proposedcryptosystem using the GF(5)-sequences will compress or minimizing the ciphertextsize comparing with the cryptosystems using GF(2)-sequences.