The word-oriented multiple-recursive matrix methods (MRMMs), introduced by Niederreiter, posses very attractive properties as they take advantage of the modern word-based processors and thus increase the throughput. Secondly, the bitstream produced by MRMM has excellent statistical properties with a high period except for low linear complexity. To increase the linear complexity, we study the cascade connection of word-oriented finite shift registers and then investigate their periodicity and linear complexity in case of MRMMs. We also extend the concept of alternating step generator and bit-oriented nonlinear combination generator to respective word-oriented generators.
MSC Classification: 94A55 , 94A60 , 15B33 , 12E20 and 12E05