LAUSR

We discuss nonlinear vectorial primitive recursive sequences. First we consider the nonlinearly filtered multiple-recursive matrix generator for producing pseudorandom vectors based on some nonlinear schemes and give lower bounds for their componentwise linear complexity. Moreover, we obtain certain results concerning the jump multiple-recursive matrix generator and establish that sequences generated by them have better period and componentwise linear complexity as compared to usual multiple-recursive matrix generator sequences. We also include analogous results for transformation shift registers for generating pseudorandom vectors.