Real-Time Prime Generators Implemented on Small-State Cellular Automata

  • Hiroshi UmeoEmail author
  • Kunio Miyamoto
  • Yasuyuki Abe
Part of the Emergence, Complexity and Computation book series (ECC, volume 12)


For a long time there was little use of prime numbers in practical applications. But nowadays, it has been known that large-scale prime numbers play a very important role in encryption in computer security networks. In this paper, we explore the prime generation problem on cellular automata consisting of infinitely many cells each with finite state memory and present two implementations of real-time prime generators on cellular automata having smallest number of internal states, known at present. It is shown that there exists a real-time prime generator on a 1-bit inter-cell communication cellular automaton with 25-states, which is an improvement over a 34-state implementation given in Umeo and Kamikawa [2003]. In addition,we show that an infinite prime sequence can be generated in real-time by an eight-state cellular automaton with constant-bit communications. Both the algorithms presented are based on the classical sieve of Eratosthenes, and our eight-state implementation is an improvement over a nine-state prime generator developed by Korec [1998]. Those two implementations on cellular automata with different communication models are the smallest realizations in the number of states, at present.


Cellular Automaton Cellular Automaton Prime Generator State Automaton Cellular Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arisawa, M.: On the generation of integer series by the one-dimensional iterative arrays of finite state machines. Trans. of IECE, 71/8 54-C(8), 759–766 (1971)Google Scholar
  2. 2.
    Dyer, C.R.: One-way bounded cellular automata. Information and Control 44, 261–281 (1980)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Fischer, P.C.: Generation of primes by a one-dimensional real-time iterative array. J. of ACM 12(3), 388–394 (1965)CrossRefzbMATHGoogle Scholar
  4. 4.
    Kamikawa, N., Umeo, H.: A study on sequence generation powers of small cellular automata. SICE Journal of Control, Measurement, and System Integration 11(1), 1–8 (2011)Google Scholar
  5. 5.
    Korec, I.: Real-time generation of primes by a one-dimensional cellular automaton with 11 states. In: Privara, I., Ružička, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 358–367. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  6. 6.
    Korec, I.: Real-time generation of primes by a one-dimensional cellular automaton with 9 states. In: Margenstern, M. (ed.) Proc. of International Colloquim on Universal Machines and Computation, MCU 1998, vol. I, pp. 101–116. IUT Metz (1998)Google Scholar
  7. 7.
    Mazoyer, J.: On optimal solutions to the firing squad synchronization problem. Theoretical Computer Science 168, 367–404 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Mazoyer, J., Terrier, V.: Signals in one-dimensional cellular automata. Theoretical Computer Science 217, 53–80 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Smith, A.R.: Real-time language recognition by one-dimensional cellular automata. J. of Computer and System Sciences 6, 233–253 (1972)CrossRefzbMATHGoogle Scholar
  10. 10.
    Umeo, H.: Problem solving on one-bit-communication cellular automata. In: Hoekstra, A.G., Kroc, J., Sloot, P.M.A. (eds.) Simulating Complex Systems by Cellular Automata, ch. 6, pp. 117–144. Springer, Heidelberg (2010)Google Scholar
  11. 11.
    Umeo, H., Kamikawa, N.: A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications. Fundamenta Informaticae 52(1-3), 255–273 (2002)MathSciNetGoogle Scholar
  12. 12.
    Umeo, H., Kamikawa, N.: Real-time generation of primes by a 1-bit-communication cellular automaton. Fundamenta Informaticae 58(3, 4), 421–435 (2003)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Univ. of Osaka Electro-CommunicationOsakaJapan
  2. 2.Japan Advanced Institute of Science and TechnologyNomiJapan

Personalised recommendations