Improved Bounds in the Multiple-Recursive Matrix Method for Pseudorandom Number and Vector Generation

The multiple-recursive matrix method is a general linear method for the generation of uniform pseudorandom numbers and vectors which was introduced and studied in earlier papers of the author. In this paper we improve on various bounds in this method by using information on σ-splitting subspaces of finite fields.