Designing security for number sequences generated by means of the sawtooth chaotic map
[ 1 ] Instytut Elektroniki i Telekomunikacji (IEt), Wydział Elektryczny, Politechnika Poznańska | [ P ] pracownik
2006
artykuł naukowy
angielski
EN In the paper, we describe how to design the security of number sequences generated by a generator, exploiting the concept of partition of the state space of the sawtooth chaotic map into disjoint subspaces. We prove that the generator can generate nonperiodic and periodic sequences with arbitrary order of elements when the map is implemented in an uncountable set, and periodic sequences with arbitrary order of elements when the map is implemented in a countable set. The numerical security of the generated sequences is shown to be comparable when we limit our observations to finite time intervals. A method of designing the security of sequences produced by the generator was proposed. It was also demonstrated that the existence of methods for reconstructing the linear congruential generator does not imply automatic reconstruction of the generator, exploiting the concept of partition of the state space of the sawtooth map implemented in a finite-state machine.
1140 - 1150