论文部分内容阅读
Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences,we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear genera-tors. We present some lower bounds in theory on the k-error linear complexity of these explicit generators,which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.
Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear genera-tors. We present some lower bounds in theory on the k -error linear complexity of these explicit generators, which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.