The self-editing generator

Based on a single ternary linear feedback shift register (LFSR) which is a combined model of the clock-controlled generator and the self-shrinking generator, a construction of a pseudo-random generator, called a self-editing generator is presented. The period, linear complexity and symbol distribution of the self-edited sequence are discussed and several cryptology indexes are compared with those of the self-shrinking sequence. The results of theoretic analysis show that the period and the linear complexity of the self-editing sequence are superior to those of the self-shrinking sequence. Furthermore, the sequence can resist the attacks from the application of the Berlekamp-Massey algorithm when the series of LFSR satisfies n60. The construction is suitable for practical implementation of efficient stream cipher cryptosystems.