A Simple Unpredictable Pseudo-Random Number Generator
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Abstract
Two closely-related pseudo-random sequence generators are presented: The ${1 / P}$generator, with input P a prime, outputs the quotient digits obtained on dividing 1 by P. The $x^2 \bmod N$generator with inputs N, $x_0 $ (where $N = P \cdot Q$ is a product of distinct primes, each congruent to 3 mod 4, and $x_0 $ is a quadratic residue $\bmod N$), outputs $b_0 b_1 b_2 \cdots $ where $b_i = {\operatorname{parity}}(x_i )$ and $x_{i + 1} = x_i^2 \bmod N$. From short seeds each generator efficiently produces long well-distributed sequences. Moreover, both generators have computationally hard problems at their core. The first generator’s sequences, however, are completely predictable (from any small segment of $2|P| + 1$ consecutive digits one can infer the “seed,” P, and continue the sequence backwards and forwards), whereas the second, under a certain intractability assumption, is unpredictable in a precise sense. The second generator has additional interesting properties: from knowledge of $x_0 $ and N but notP or Q, one can generate the sequence forwards, but, under the above-mentioned intractability assumption, one can not generate the sequence backwards. From the additional knowledge of P and Q, one can generate the sequence backwards; one can even “jump” about from any point in the sequence to any other. Because of these properties, the $x^2 \bmod N$generator promises many interesting applications, e.g., to public-key cryptography. To use these generators in practice, an analysis is needed of various properties of these sequences such as their periods. This analysis is begun here.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Golomb, S. W. (2017) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,180
History of the theory of numbers
Dickson, L. E. (1919) · Carnegie Institution of Washington eBooks · doi:10.5962/t.174869 · Cited by 1,691
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,322
Self-citationCattermole, K. W. (1968) · Electronics and Power · doi:10.1049/ep.1968.0141 · Cited by 1,319
Even, S. (1979) · Cited by 1,280
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Formal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
The Art of Computer Programming, Vol. 2
Knuth, D. E. (1981) · Medical Entomology and Zoology · Cited by 886
Probabilistic encryption & how to play mental poker keeping secret all partial information
Goldwasser, S., & Micali, S. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802212 · Cited by 883
Probabilistic algorithm for testing primality
Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 863
Ergodic Theory and Information.
Kingman, J. F. C., & Billingsley, P. (1966) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343508 · Cited by 779
A Fast Monte-Carlo Test for Primality
Solovay, R., & Strassen, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206006 · Cited by 635
LeVeque, W. J. (1977) · Cited by 258
How to generate cryptographically strong sequences of pseudo random bits
Blum, M., & Micali, S. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.72 · Cited by 252
Self-citationS., D., Gauss, C. F., & Clarke, A. A. (1966) · Mathematics of Computation · doi:10.2307/2003555 · Cited by 233
Solved and Unsolved Problems in Number Theory
Bellman, R., & Shanks, D. (1963) · Mathematics of Computation · doi:10.2307/2004020 · Cited by 189
On the generation of cryptographically strong pseudo-random sequences
Adi Shamir, Z. (1981) · Lecture notes in computer science · doi:10.1007/3-540-10843-2_43 · Cited by 103
Inferring a sequence generated by a linear congruence
Plumstead, J. B. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.73 · Cited by 76
Shamir, A., Rivest, R. L., & Adleman, L. M. (1981) · Springer eBooks · doi:10.1007/978-1-4684-6686-7_5 · Cited by 76
Solved and Unsolved Problems in Number Theory.
LeVeque, W. J., & Shanks, D. (1964) · American Mathematical Monthly · doi:10.2307/2312370 · Cited by 44
Research works printed but not linked: 6
- L. Adleman, On distinguishing prime numbers from composite numbers, Proc. 21st IEEE Symposium on Foundations of Computer Science, 1980, 387–408 · DOI
- M. Blum, Coin flipping by telephone, Proc. IEEE Spring COMPCON, 1982, 133–137
- G. Brassard, D. Chaum, R. L. Rivest, A. T. Sherman, On computationally secure authentication tags requiring short secret shared keys, Advances in Cryptology, Proc. of Crypto 82, Plenum Press, New York, 1983, 79–86 · doi:10.1007/978-1-4757-0602-4_7
- Kac Mark, 1983, Amer. Sci., 71, 405
- G. Miller, Ph.D. Thesis, Riemann's hypothesis and tests for primality, Univ. California, Berkeley, 1975 · DOI · Paper page
- von Neumann J., 1963, Collected Works, 5, 768
Cited by
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00008-8 · Cited by 2,937
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
Metadata
- Authors
- Blum, L., Blum, M., & Shub, M.
- Venue
- SIAM Journal on Computing
- Published
- 1986-05
- Volume
- 15
- Issue
- 2
- Pages
- 364-383
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2085759780
- Semantic Scholar
- cfeb641dc3b188e4e52c13f72ccb78170e98552c
- Cited by
- 1,036
- References
- 25
- Citations by year
- 2026: 16 · 2025: 31 · 2024: 30 · 2023: 19 · 2022: 36 · 2021: 28 · 2020: 32 · 2019: 31 · 2018: 40 · 2017: 40 · 2016: 38 · 2015: 43 · 2014: 52 · 2013: 47 · 2012: 45
- FWCI
- 30.58
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- SIAM Journal on Computing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Keywords
- pseudorandom number generators, prime modulus, public-key cryptography
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.