On <Emphasis Type="Italic">k</Emphasis>-error linear complexity of some explicit nonlinear pseudorandom sequences

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 generators. 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. Foundation item: Supported by the Natural Science Foundation of Fujian Province (2007F3086), the Funds of the Education Department of Fujian Province ( JA07164) and the Open Funds of Key Laboratory of Fujian Province University Network Security and Cryptology (07B005)