A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space

DOI10.1007/978-3-540-85912-3_26zbMath1206.94034OpenAlexW1874131453MaRDI QIDQ3600449

Makoto Matsumoto, Pierre L'Ecuyer, Hiroshi Haramoto

Publication date: 10 February 2009

Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85912-3_26

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items

A note on the multiple-recursive matrix method for generating pseudorandom vectors

Cites Work

• Improved long-period generators based on linear recurrences modulo 2
• Analysis and design of stream ciphers
• Uniform random number generation
• Efficient Jump Ahead for 𝔽₂-Linear Random Number Generators
• Mersenne twister
• Twisted GFSR generators II
• Lattice computations for random numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item