Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.

A Simple Unpredictable Pseudo-Random Number Generator

Blum, L., Blum, M., Shub, M.·1986·SIAM Journal on Computing

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

Crossref · 10.1137/0215025

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 25 references

Research works printed but not linked: 6

  1. L. Adleman, On distinguishing prime numbers from composite numbers, Proc. 21st IEEE Symposium on Foundations of Computer Science, 1980, 387–408 · DOI
  2. M. Blum, Coin flipping by telephone, Proc. IEEE Spring COMPCON, 1982, 133–137
  3. 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
  4. Kac Mark, 1983, Amer. Sci., 71, 405
  5. G. Miller, Ph.D. Thesis, Riemann's hypothesis and tests for primality, Univ. California, Berkeley, 1975 · DOI · Paper page
  6. von Neumann J., 1963, Collected Works, 5, 768

Cited by

See all 1,036

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
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Simple Unpredictable Pseudo-Random Number Generator. https://app.cochat.ai/papers/10.1137/0215025
The paper
Blum, L., Blum, M., & Shub, M. (1986). A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing. https://doi.org/10.1137/0215025

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.