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

In this paper, the discretized Tent map is analyzed as a source of pseudorandom bits. To evaluate the performance of the proposed pseudorandom bit generators (PRBGs), different issues were considered, such as the period length, the statistical characteristics of the generated bit sequences, and the hardware complexity required in digital circuit implementations. The results show that, under proper design conditions, the Tent-map-based PRBGs represent a suitable alternative to other traditional low-complexity PRBGs such as the linear feedback shift registers.