Abstract
One of the possible applications of chaotic oscillators is generating sequences of pseudorandom binary numbers. This chapter describes a methodology for generating such pseudorandom binary numbers from the logistic map, Lorenz and Rossler chaotic systems, Chua and chaotic oscillator based on saturated function series. A form to measure if a sequence of binary numbers is random is by its entropy. Therefore, this chapter also describes how to take the entropy measurement. A complete test for checking the randomness of binary sequences is the one provided by the National Institute for Standards and Technology (NIST). Thus, this chapter discusses NIST measurements. The first topic is devoted to show the procedure for generating random binary numbers with the very basic equations of the logistic map. Examples with the Lorenz and Rossler systems and with the Chua’s and chaotic oscillator based on saturated function series are also given.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
