Stream Ciphering Techniques Based on n-Tuples Juxtaposition Sequences
Francesco Fabris · Journal of Information and Optimization Sciences · 1989
In this paper it is shown that the family of periodic sequences obtained by arbitrarily juxtaposing the 2 n different binary n-tuples have good pseudo-randomness performance, since they pass several pseudo-randomness tests (namely Golomb’s postulates, the k-tuples frequency test and the seríal test) more and more accurately as n goes to infinity. Besides, the behaviour of the sequences complexity profile is investigated, a lower bound for the expected linear complexity and an upper bound for the probability of obtaining a complexity less than some prefixed constant are derived. Also, some experimental results, related with the distribution of complexity over the set of sequences, are communicated. Finally it is shown that the stream ciphering techniques are a possible application area for the given results.