Generating random binary sequences using tent map

We propose two methods for generating binary sequences complying with a fair coin tossing model, starting from the tent map. The methods are supported theoretically and experimentally. As tent map is described by the uniform probability law, the statistical independence of successive binary symbols is the main problem under discussion. A first method transforms the successive values of the tent map into a binary sequence by means of a comparison with a threshold chosen equal to the tent map parameter. Considering type II statistical error involved in the test of a fair coin, it was shown that for appropriate values of the tent map parameter, a memoryless binary source of practical zero redundancy is obtained. A second proposed method takes advantage from a previous study dedicated to the statistical independence issue in the tent map. Thus, after a periodical sampling with an appropriate period, the tent map values are transformed into a binary sequence by comparison with a threshold equal to 0.5.