A New Algorithm of M Sequences Generation

Zhao Qun-yi · 2007

Based on the theory that a feedback shift register can generate a sequence, this paper puts forward a new high-efficient algorithm, which can construct n stage (n32) M sequences from feedback polynomials. This paper also presents a new kind of sequences (M-1 sequences) based on this algorithm. In the result of algorithm, the feedback polynomials are very simple, can be easily implemented by hardware. This scheme is practical and can be reference to designing the key generator of stream cipher, as well as used in communication and code.

Read the paper · More papers on PaperTik