An efficient lattice reduction method for -linear pseudorandom number generators using Mulders and Storjohann algorithm
Under an Elsevier user license
open archive
Highlights
► We propose an efficient lattice reduction method for -linear sequence generators. ► The key is Mulders and Storjohann algorithm for reduction. ► It improves the order of the computational complexity. ► Experiments show a speed-up by a factor of three. ► We also report acceleration by using a sparsest initial state.
MSC
65C10
11K45
Keywords
Random number generation
Uniformity
Lattice reduction algorithm
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.