FPGA implementation and evaluation of two cryptographically secure hybrid cellular automata

Two solutions for designing cryptographically secure pseudo-random number generators are considered from the perspective of FPGA implementation. Both are based on hybrid cellular automata (HCA) and are designed to maximize the efficiency/throughput ratio. While the first PRNG employs a simple HCA, the second solution builds a chain of HCA devices in order to improve cryptographic properties. Both solutions were implemented on FPGA-based platforms and their performances are evaluated in terms of complexity, speed and power. Pseudorandom sequences generated by the hardware implementations were extracted, saved and further analyzed using the standardized NIST statistical tests. All 188 tests were passed.