Affiliation:
1. Technische Hochschule, Darmstadt, Germany
2. Austrian Academy of Sciences, Vienna, Austria
Abstract
A new algorithm, the
digital inversive method
, for generating uniform pseudorandom numbers is introduced. This algorithm starts from an inversive recursion in a large finite field and derives pseudorandom numbers from it by the digital method. If the underlying finite field has
q
elements, then the sequences of digital inversive pseudorandom numbers with maximum possible period length
q
can be characterized. Sequences of multiprecision pseudorandom numbers with very large period lengths are easily obtained by this new method. Digital inversive pseudorandom numbers satisfy statistical independence properties that are close to those of truly random numbers in the sense of asymptotic discrepancy. If
q
is a power of 2, then the digital inversive method can be implemented in a very fast manner.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,Modelling and Simulation
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献