Keywords
Pseudorandom number generatorMathematicsGenerator (circuit theory)Sequence (biology)PolynomialInteger (computer science)Discrete mathematicsCombinatoricsAlgorithmComputer sciencePhysicsMathematical analysis
Affiliated Institutions
Related Publications
Efficient and portable combined random number generators
In this paper we present an efficient way to combine two or more Multiplicative Linear Congruential Generators (MLCGs) and propose several new generators. The individual MLCGs, ...
Primality and Cryptography.
From the Publisher: A comprehensive account of recent algorithms developed in computational number theory and primality testing. Provides a general framework for the theoretica...
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...
Algorithms for quantum computation: discrete logarithms and factoring
A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in computation tim...
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...
Publication Info
- Year
- 2007
- Type
- book-chapter
- Pages
- 138-153
- Citations
- 16
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
16
OpenAlex
Cite This
Hugo Krawczyk
(2007).
How to Predict Congruential Generators.
Lecture notes in computer science
, 138-153.
https://doi.org/10.1007/0-387-34805-0_14
Identifiers
- DOI
- 10.1007/0-387-34805-0_14