Real-Time Prime Generators Implemented on Small-State Cellular Automata
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 . 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 . Those two implementations on cellular automata with different communication models are the smallest realizations in the number of states, at present.
KeywordsCellular Automaton Cellular Automaton Prime Generator State Automaton Cellular Space
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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