How useful randomness for cryptography can emerge from multicore-implemented complex networks of chaotic maps

Abstract

This article is devoted to the study of several topologies of complex networks of chaotic maps, in order to design new Chaotic Pseudo Random Number Generators for cryptographic purpose in a bottom up approach of doing mathematics. We examine topologies of special 2 -D coupled maps which are built combining piecewise linear and logistic maps. We present also a family of p -Dimensional networks whose we study numerically a particular realization, up to one hundred trillion iterates using multicores computers. From those topologies emerges useful randomness for cryptographic purpose.