Keywords
Equidistributed sequenceTrinomialMathematicsPseudorandom number generatorSequence (biology)AutocorrelationRecursion (computer science)CombinatoricsShift registerPolynomialDiscrete mathematicsAlgorithmStatistics
Affiliated Institutions
Related Publications
Strengths and Weaknesses of Quantum Computing
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabil...
IP = PSPACE
In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be gen...
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an incr...
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such de...
Theorems on factorization and primality testing
1. Introduction . This paper is concerned with the problem of obtaining theoretical estimates for the number of arithmetical operations required to factorize a large integer n o...
Publication Info
- Year
- 1990
- Type
- article
- Volume
- 31
- Issue
- 1
- Pages
- 105-118
- Citations
- 22
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
22
OpenAlex
Cite This
Masanori Fushimi
(1990).
Random number generation with the recursion Xt = Xt−3p ⊕ Xt−3q.
Journal of Computational and Applied Mathematics
, 31
(1)
, 105-118.
https://doi.org/10.1016/0377-0427(90)90341-v
Identifiers
- DOI
- 10.1016/0377-0427(90)90341-v