An approach to the generation of pseudo-random binary digits 117 billion by scrambling product M-sequences of low degree

摘要

This paper is concerned with the generation of Pseudo-random binary sequences with good randomness from a Product M-sequences of low degree using a scrambler, which is consisted of linear feedback shift registers (17 or 23 stages). In this paper, we show an illustration of 117 billion binary sequences from Product M-sequence of 4 and 5 degree with a scrambler. To evaluate the randomness, we focus our attention on the geometric length distribution with respect to binary gaps among the produced sequence, and x{sup}2 null hypothesis test for the above distribution.