Hybrid DNA Cellular Automata for pseudorandom number generation

During the last decades, certain research emphasis has been placed on building synthetic molecular machinery from DNA. In specific, biological systems in which individual molecules act, singly and in concert, as specialized machines result are called DNA machines. 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 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. Moreover, a HADCA simulator was developed to encourage the possible use of the biological inspired computation tool. Finally, it is shown that a proposed 1-d HADCA can generate high-quality random numbers which can pass the statistical tests of DIEHARD, one of the most well known general test suites for randomness. Consequently, such a HADCA can be efficiently implemented for pseudorandom number generation (PRNG) reasons.