An efficient lattice reduction method for F2-linear pseudorandom number generators using Mulders and Storjohann algorithm
نویسنده
چکیده
منابع مشابه
Fast lattice reduction for F2-linear pseudorandom number generators
Sequences generated by an F2-linear recursion have wide applications, in particular, pseudorandom number generation. The dimension of equidistribution with v-bit accuracy is a most important criterion for the uniformity of the generated sequence. The fastest known method for computing these dimensions is proposed by Couture and L’Ecuyer, based on Lenstra’s lattice basis reduction and the dual l...
متن کاملOn the F2-linear relations of Mersenne Twister pseudorandom number generators
Sequence generators obtained by linear recursions over the two-element field F2, i.e., F2-linear generators, are widely used as pseudorandom number generators. For example, the Mersenne Twister MT19937 is one of the most successful applications. An advantage of such generators is that we can assess them quickly by using theoretical criteria, such as the dimension of equidistribution with v-bit ...
متن کاملOn lattice reduction for polynomial matrices
A simple algorithm for lattice reduction of polynomial matrices is described and analysed. The algorithm is adapted and applied to various tasks, including rank profile and determinant computation, transformation to Hermite and Popov canonical form, polynomial linear system solving and short vector computation. © 2003 Elsevier Science Ltd. All rights reserved.
متن کاملLattice Structure of Nonlinear Pseudorandom Number Generators in Parts of the Period
Recently, we showed that an extension of Marsaglia’s lattice test for segments of sequences over arbitrary fields and the linear complexity profile provide essentially equivalent quality measures for the intrinsic structure of pseudorandom number sequences. More precisely, the knowledge of the linear complexity profile yields a value S such that the largest dimension for passing the above latti...
متن کاملInversive Congruential Pseudorandom Numbers Avoid the Planes
Nonlinear congruential pseudorandom number generators based on inversions have recently been introduced and analyzed. These generators do not show the lattice structure of the widely used linear congruential method. In the present paper it is proved that the points formed by d consecutive pseudorandom numbers of an inversive congruential generator with prime modulus possess an even stronger pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 236 شماره
صفحات -
تاریخ انتشار 2011