Hardware-efficient PRBGs based on 1-D piecewise linear chaotic maps

In this paper, two families of digital maps derived from the sawtooth map and from the tent map are analyzed in terms of suitability for pseudo-random bit generation. In particular, several solutions are investigated taking into account the numerical errors due to the approximation strategy used (truncation/rounding off). To evaluate the performance of the obtained pseudo-random sources a number of statistical parameters and tests that properly measure the characteristics of output bit sequences are considered. Results show that, under specific design conditions, the discretized sawtooth and tent maps are suitable for generating long-period bit sequences with an adequate randomness quality.