2017/06/25 by Mohammed Bakiri, Bakiri, Mohammed, Jean-François Couchot +3
Computer Science · #Chaos-based Image/Signal Encryption #Cellular Automata and Applications #Evolutionary Algorithms and Applications
paper · pdf · doi:10.48550/arxiv.1706.08093
Sub-categories of mathematical topology, like the mathematical theory of\nchaos, offer interesting applications devoted to information security. In this\nresearch work, we have introduced a new chaos-based pseudorandom number\ngenerator implemented in FPGA, which is mainly based on the deletion of a\nHamilton cycle within the n-cube (or on the vectorial negation), plus one\nsingle permutation. By doing so, we produce a kind of post-treatment on\nhardware pseudorandom generators, but the obtained generator has usually a\nbetter statistical profile than its input, while running at a similar speed. We\ntested 6 combinations of Boolean functions and strategies that all achieve to\npass the most stringent TestU01 battery of tests. This generation can reach a\nthroughput/latency ratio equal to 6.7 Gbps, being thus the second fastest FPGA\ngenerator that can pass TestU01.\n