Random sequence generation by cellular automata
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
CA can be used in cryptosystems or to generate random sequences.
“Thus, CA can be used in cryptosystems [142,143] or to generate random sequences [144].”
From Chaos-Based Image Encryption: Review, Application, and Challenges (2023) · cites this paper as [144]
Parallel random bit generation methods could dramatically improve the generation rate and scalability by producing many random bits simultaneously.
“Parallel random bit generation methods could dramatically improve the generation rate and scalability by producing many random bits simultaneously.”
From Scalable parallel physical random number generator based on a superluminescent LED (2011) · cites this paper as [11]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
(1979) · Cited by 43,841 · see citing works
Snedecor, G. W., Cochran, W. G., & STOUT, B. B. (1939) · Soil Science · doi:10.1097/00010694-193902000-00006 · Cited by 19,423 · see citing works
Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields
Guckenheimer, J., & Holmes, P. (1983) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-1140-2 · Cited by 16,144 · see citing works
Statistical mechanics of cellular automata
Wolfram, S. (1983) · Reviews of Modern Physics · doi:10.1103/revmodphys.55.601 · Cited by 3,059 · see citing works
Self-citationGoldwasser, S., & Micali, S. M. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,667 · see citing works
Computation: Finite and Infinite Machines.
Clarke, D. A., & Minsky, M. (1968) · American Mathematical Monthly · doi:10.2307/2313471 · Cited by 2,600 · see citing works
Uniform distribution of sequences
Kuipers, L., & Niederreiter, H. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,400 · see citing works
Golomb, S. W. (2014) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,194 · see citing works
Logic Minimization Algorithms for VLSI Synthesis
Brayton, R. K., Hachtel, G. D., McMullen, C. T., et al. (1984) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-2821-6 · Cited by 1,981 · see citing works
Universality and complexity in cellular automata
Wolfram, S. (1984) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(84)90245-8 · Cited by 1,938 · see citing works
Self-citationA formal theory of inductive inference. Part II
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90131-7 · Cited by 1,758 · see citing works
Hillis, W. D. (1987) · Scientific American · doi:10.1038/scientificamerican0687-108 · Cited by 1,637 · see citing works
Cellular automata as models of complexity
Wolfram, S. (1984) · Nature · doi:10.1038/311419a0 · Cited by 1,507 · see citing works
Self-citationCodd, E. F. (1968) · Cited by 1,350 · see citing works
Cattermole, K. W. (1968) · Electronics and Power · doi:10.1049/ep.1968.0141 · Cited by 1,326 · see citing works
How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Blum, M., & Micali, S. M. (1984) · SIAM Journal on Computing · doi:10.1137/0213053 · Cited by 1,309 · see citing works
Nonlinear Oscillations Dynamical Systems, and Bifurcations of Vector Fields
Guckenheimer, J. M., Holmes, P. J., & Slemrod, M. (1984) · Journal of Applied Mechanics · doi:10.1115/1.3167759 · Cited by 1,283 · see citing works
The definition of random sequences
Martin-Löf, P. (1966) · Information and Control · doi:10.1016/s0019-9958(66)80018-9 · Cited by 1,208 · see citing works
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192 · see citing works
Endomorphisms and automorphisms of the shift dynamical system
Hedlund, G. A. (1969) · Theory of Computing Systems · doi:10.1007/bf01691062 · Cited by 1,058 · see citing works
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,011 · see citing works
Parity, circuits, and the polynomial-time hierarchy
Furst, M., Saxe, J. B., & Sipser, M. (1984) · Theory of Computing Systems · doi:10.1007/bf01744431 · Cited by 942 · see citing works
On the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1969) · Journal of the ACM · doi:10.1145/321495.321506 · Cited by 935 · see citing works
On the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1966) · Journal of the ACM · doi:10.1145/321356.321363 · Cited by 913 · see citing works
Randomness and Mathematical Proof
Chaitin, G. J. (1975) · Scientific American · doi:10.1038/scientificamerican0575-47 · Cited by 674 · see citing works
Computation theory of cellular automata
Wolfram, S. (1984) · Communications in Mathematical Physics · doi:10.1007/bf01217347 · Cited by 634 · see citing works
Self-citationThe 3 x + 1 Problem and its Generalizations
Lagarias, J. C. (1985) · American Mathematical Monthly · doi:10.1080/00029890.1985.11971528 · Cited by 427 · see citing works
Algebraic properties of cellular automata
Martin, O., Odlyzko, A. M., & Wolfram, S. (1984) · Communications in Mathematical Physics · doi:10.1007/bf01223745 · Cited by 414 · see citing works
Self-citationPhysics-like models of computation
Margolus, N. (1984) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(84)90252-5 · Cited by 411 · see citing works
Cryptography with Cellular Automata
Wolfram, S. (2007) · Springer eBooks · doi:10.1007/3-540-39799-x_32 · Cited by 379 · see citing works
Self-citationThe 3x + 1 Problem and Its Generalizations
Lagarias, J. C. (1985) · American Mathematical Monthly · doi:10.2307/2322189 · Cited by 269 · see citing works
On the generation of cryptographically strong pseudorandom sequences
Adi Shamir, Z. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357353.357357 · Cited by 266 · see citing works
Undecidability and intractability in theoretical physics
Wolfram, S. (1985) · Physical Review Letters · doi:10.1103/physrevlett.54.735 · Cited by 240 · see citing works
Self-citationProbability Distributions Related to Random Mappings
Harris, B. (1960) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177705677 · Cited by 224 · see citing works
Dynamical Systems and Cellular Automata
Demongeot, J., Goles, É., & Tchuenté, M. (1985) · Medical Entomology and Zoology · Cited by 153 · see citing works
Computer Software in Science and Mathematics
Wolfram, S. (1984) · Scientific American · doi:10.1038/scientificamerican0984-188 · Cited by 141 · see citing works
Self-citationOrigins of randomness in physical systems
Wolfram, S. (1985) · Physical Review Letters · doi:10.1103/physrevlett.55.449 · Cited by 120 · see citing works
Self-citationCAM: A high-performance cellular-automaton machine
Toffoli, T. (1984) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(84)90261-6 · Cited by 112 · see citing works
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 · see citing works
An unsolved problem on the powers of 3/2
Mahler, K. (1968) · Journal of the Australian Mathematical Society · doi:10.1017/s1446788700005371 · Cited by 103 · see citing works
Geometry of Binomial Coefficients
Wolfram, S. (1984) · American Mathematical Monthly · doi:10.1080/00029890.1984.11971496 · Cited by 77 · see citing works
Self-citationGlobal properties of cellular automata
Jen, E. (1986) · Journal of Statistical Physics · doi:10.1007/bf01010579 · Cited by 58 · see citing works
Geometry of Binomial Coefficients
Wolfram, S. (1984) · American Mathematical Monthly · doi:10.2307/2323743 · Cited by 37 · see citing works
Self-citationWagon, S. (1985) · The Mathematical Intelligencer · doi:10.1007/bf03025811 · Cited by 31 · see citing works
An answer to a question by J. Milnor
Sinaǐ, Y. G. (1985) · Commentarii Mathematici Helvetici · doi:10.1007/bf02567408 · Cited by 24 · see citing works
Statistical study of digits of some square roots of integers in various bases
Beyer, W. A., Metropolis, N., & Neergaard, J. R. (1970) · Mathematics of Computation · doi:10.1090/s0025-5718-1970-0272129-1 · Cited by 9 · see citing works
A multi-processor cellular automaton chip
Steiglitz, K., & Morita, R. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1985.1168506 · Cited by 5 · see citing works
Flagged first, then by citations
Research works printed but not linked: 13
- D. KNUTH, "Seminumerical Algorithms," Addison-Wesley, Reading, Mass., 1981.
- L. LEVIN, On the notion of a random sequence, Soviet Math. Do/d. 14 (1973), 1413.
- L. BLUM, M. BLUM, AND M. SHUB, Comparison of two pseudorandom number generators, in "Advances in Cryptology: Proc. of CRYPTO-82" (D. Chaum, R. Rivest, and A. T. Sherman, Eds.), Plenum, New York, 1983.
- W. ALEXI, B. CHOR, 0. GOLDREICH, AND C. SCHNORR, RSA/Rabin bits are f + l/poly(logN) secure, in "Proc. Found. Comput. Sci.," (1984);
- U. VAZIRANI AND V. VAZIRANI, Efficient and secure pseudorandom number generation, in "Proc. Found. Comput. Sci.," 1984.
- K. MAHL.ER, An unsolved problem on the powers of I, Proc. Austrd. Math. Sot. 8 (1968), 313;
- S. WOLFRAM, Cellular automata and condensed matter physics, in Proc. NATO Advanced Study Institute on Scaling phenomena in disordered systems, April 1985.
- J. MILNOR, Notes on smjective cellular automaton-maps, Institute for Advanced Study preprint, June 1984.
- J. Statist. Phys., in press.
- J. MILNOR, Entropy of cellular automaton-maps, Institute for Advanced Study preprint, May 1984; Directional entropies of cellular automaton maps, Institute for Advanced Study preprint, October 1984.
- G. MARSAGLIA, A current view of random number generators, in "Proc. Comput. Sci. and Statistics, 16th Sympos. on the Interface," Atlanta, March 1984.
- S. WAGON, Is rr normal?, Math. Intelligencer. 7 (1985), 65.
- P. GRASSBERGER, "Towards a quantitative theory of self-generated complexity," Wuppertal preprint (1986).
Cited by
Sorted by citations
Fast physical random bit generation with chaotic semiconductor lasers
Uchida, A., Amano, K., Inoue, M., Hirano, K., Naito, S., Someya, H., Oowada, I., Kurashige, T., Shiki, M., Yoshimori, S., et al. (2008) · Nature Photonics · doi:10.1038/nphoton.2008.227 · Cited by 1,024 · see citing works
Color image encryption based on hybrid hyper-chaotic system and cellular automata
Yaghouti Niyat, A., Moattar, M. H., & Niazi Torshiz, M. (2017) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2016.10.019 · Cited by 383 · see citing works
Chaos-Based Image Encryption: Review, Application, and Challenges
Zhang, B., & Liu, L. (2023) · Mathematics · doi:10.3390/math11112585 · Cited by 328 · see citing works
“Thus, CA can be used in cryptosystems [142,143] or to generate random sequences [144].”
MethodParallel random number generation for VLSI systems using cellular automata
Hortensius, P. D., McLeod, R. D., & Card, H. C. (1989) · IEEE Transactions on Computers · doi:10.1109/12.35843 · Cited by 225 · see citing works
Scalable parallel physical random number generator based on a superluminescent LED
Li, X., Cohen, A. B., Murphy, T. E., & Roy, R. (2011) · Optics Letters · doi:10.1364/ol.36.001020 · Cited by 146 · see citing works
Design of image cipher using life-like cellular automata and chaotic map
Ping, P., Wu, J., Mao, Y., Xu, F., & Fan, J. (2018) · Signal Processing · doi:10.1016/j.sigpro.2018.04.018 · Cited by 71 · see citing works
Parallel random number generator for inexpensive configurable hardware cells
Ackermann, J., Tangen, U., Bödekker, B., Breyer, J., Stoll, E., & McCaskill, J. S. (2001) · Computer Physics Communications · doi:10.1016/s0010-4655(01)00242-9 · Cited by 21 · see citing works
- Authors
- Wolfram, S.
- Affiliations
- Institute for Advanced Study (US)
- Corresponding author
- Wolfram, Stephen
- ORCID
- Wolfram, Stephen
- Venue
- Advances in Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1986-06
- Volume
- 7
- Issue
- 2
- Pages
- 123-169
- ISSN
- 0196-8858 (ISSN-L)
- OpenAlex
- W1985043179
- Cited by
- 494
- References
- 47
- Citations by year
- 2026: 14 · 2025: 19 · 2024: 12 · 2023: 17 · 2022: 21 · 2021: 19 · 2020: 15 · 2019: 20 · 2018: 24 · 2017: 22 · 2016: 10 · 2015: 19 · 2014: 17 · 2013: 16 · 2012: 22
- FWCI
- 10.50
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Advances in Applied Mathematics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Keywords
- cellular automata, random sequence generation, pseudorandom number generation, one-dimensional cellular automata, binary sequences, statistical randomness, dynamical systems theory, computational complexity
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
