The Digital Tent Map: Performance Analysis and Optimized Design as a Source of Pseudo-Random Bits

In this paper, a digital implementation of the Tent map is analyzed as a source of pseudo-random bits. 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 the output bit sequences are considered. Results show that, under specific design conditions, the discretized Tent map can be proposed as a suitable solution for the implementation of an integrated pseudo random bit generator.