The Construction And Analysis Of Two New Types Of Pseudo-random Sequence Generator

In this paper, we present two new types of pseudo-random sequence generator:the Editing Generator and the Shrinking-extended Generator(called SE-generator in short).They are both constructed by using two ternary linear feedback shift registers(LFSR).Both the edited sequences' and the SE-sequences' period,symbol distribution and linear complexity are discussed in this paper.In addition,we also analysis the stability of this new edited sequence by discussing its 1,2complexity of weight,and give the characteristic polynomial of the SE-sequence as well,but we just give the SE-sequence's lower bound of linear complexity as a conjecture. In the end, the main cryptography indexes of several controlled generators are compared in the paper.It is shown that the period and linear complexity of the edited sequence and the SE-sequence are both superior to those of the stop-go sequence (reference[3]) and the shrinking sequence (reference [3]), and the symbol distribution of these two sequences are also clearer than those two,so they are better pseudo-random sequences and more suitable for practice implementation of stream cipher systems.