A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space
Linear recurring sequences with very large periods are widely used as the basic building block of pseudorandom number generators. In many simulation applications, multiple streams of random numbers are needed, and these multiple streams are normally provided by jumping ahead in the sequence to obtain starting points that are far apart. For maximal-period generators having a large state space, this jumping ahead can be costly in both time and memory usage. We propose a new jump ahead method for this kind of situation. It requires much less memory than the fastest algorithms proposed earlier, while being approximately as fast (or faster) for generators with a large state space such as the Mersenne twister.
KeywordsStream Cipher Polynomial Multiplication Pseudorandom Number Generator Linear Feedback Shift Register Linear Recurrence
Unable to display preview. Download preview PDF.
- 1.Law, A.M., Kelton, W.D.: Simulation Modeling and Analysis, 3rd edn. McGraw-Hill, New York (2000)Google Scholar
- 3.L’Ecuyer, P.: Pseudorandom number generators. In: Platen, E., Jaeckel, P. (eds.) Simulation Methods in Financial Engineering. Encyclopedia of Quantitative Finance. Wiley, Chichester (forthcoming, 2008)Google Scholar
- 6.Haramoto, H., Matsumoto, M., Nishimura, T., Panneton, F., L’Ecuyer, P.: Efficient jump ahead for F 2-linear random number generators. INFORMS Journal on Computing (to appear, 2008)Google Scholar
- 9.L’Ecuyer, P., Panneton, F.: F 2-linear random number generators. In: Alexopoulos, C., Goldsman, D. (eds.) Advancing the Frontiers of Simulation: A Festschrift in Honor of George S. Fishman, Spinger, New York (to appear, 2007)Google Scholar