Parallel Application of Hybrid DNA Cellular Automata for Pseudorandom Number Generation

With the advent of massively parallel scientific computation, the parallel generation of pseudorandom numbers has become essential. During the last decades several researchers have successfully implemented Cellular Automata (CA) as Pseudorandom Number Generators (PRNGs). On the other hand, recently Autonomous DNA Turing Machines and DNA Cellular Automata were proposed as cellular computing devices that can serve as reusable, compact computing devices to perform (universal) computation. In this paper, we introduce a methodology for the design of one-dimensional (1-d) Hybrid Autonomous DNA Cellular Automata (HADCA), able to run in parallel, different CA rules with certain modifications on their molecular implementation and information flow compared to their origins. In this aspect, an easy to use HADCA simulator was developed to encourage the possible use of the biological inspired computation tool. As a result, the proposed 1-d HADCAs are used to generate high-quality random numbers which can pass the statistical tests of DIEHARD, one of the most well known general test suites for randomness, proving their suitability as PRNGs.