Marginal singularities, almost invariant sets, and small perturbations of chaotic dynamical systems

1991 ◽  
Vol 1 (3) ◽  
pp. 347-356 ◽  
Author(s):  
M. L. Blank
2014 ◽  
Vol 1 (1) ◽  
pp. 135-162 ◽  
Author(s):  
Gary Froyland ◽  
◽  
Philip K. Pollett ◽  
Robyn M. Stuart ◽  
◽  
...  

2001 ◽  
Vol 08 (02) ◽  
pp. 137-146 ◽  
Author(s):  
Janusz Szczepański ◽  
Zbigniew Kotulski

Pseudorandom number generators are used in many areas of contemporary technology such as modern communication systems and engineering applications. In recent years a new approach to secure transmission of information based on the application of the theory of chaotic dynamical systems has been developed. In this paper we present a method of generating pseudorandom numbers applying discrete chaotic dynamical systems. The idea of construction of chaotic pseudorandom number generators (CPRNG) intrinsically exploits the property of extreme sensitivity of trajectories to small changes of initial conditions, since the generated bits are associated with trajectories in an appropriate way. To ensure good statistical properties of the CPRBG (which determine its quality) we assume that the dynamical systems used are also ergodic or preferably mixing. Finally, since chaotic systems often appear in realistic physical situations, we suggest a physical model of CPRNG.


1983 ◽  
Vol 3 (1) ◽  
pp. 119-127 ◽  
Author(s):  
Yuri Kifer

AbstractWe introduce for dynamical systems in metric spaces some numbers which in the case of smooth dynamical systems turn out to be the maximal and the minimal characteristic exponents. These numbers have some properties similar to the smooth case. Analogous quantities are defined also for invariant sets.


1991 ◽  
Vol 05 (14) ◽  
pp. 2323-2345 ◽  
Author(s):  
R.E. AMRITKAR ◽  
P.M. GADE

We discuss different methods of characterizing the loss of memory of initial conditions in chaotic dynamical systems.


Sign in / Sign up

Export Citation Format

Share Document