2次M系列の線形複雑度について

Abstract

M sequence is known as good random number generating algorithm. However, its linear complexity is very small for stream cipher. On the other hand, there is a quardratic M-sequence which added the secondary term to the generation formula. Then, expecting quardartic m-sequence [1] has large complexty, we investigate its sequeces and complexity. As the results, we get: (1) one m-sequence is divided some partial sequences, (2) those linear complexity take neary periods.