Analysis of formal randomness in a chaotic random number generator

Sampled chaotic oscillators are promising structures for generating cryptographically secure random numbers. In this paper they are formally analyzed according to Kolmogorov complexity. This theory gives one of the most stringent measures of randomness. The results are that the generator will generate a totally random output.