scholarly journals Pseudo Random Bits Generation Using Chaotic Functions

Author(s):  
Ajitha Sukumaran

The telecommunication development technologies especially mobile and internet networks had extended the demand of information transmission. This results as a challenge to protect the information from the attackers. These require advanced encryption systems to protect the information during transmission. Cryptography is a basic information security measure that encodes messages to make them non-readable. During last two and a half decades, several studies of chaos based on cryptosystems had been developed. An application of discrete chaotic dynamical systems in pseudo random bit generation (PRBG) has been widely studied recently. In each study, proposed a separate pseudo random generation for a particular map running side-by-side in one of them or proposing a hybrid chaotic system used two different maps. The PRBG is generated by combining then comparing the output of both chaotic maps.  This report will show the previous studies done in the different ways to generate pseudo random bit. Methods will be discussed in details for the algorithmic formula done for each system and what logical operations done for combination and comparing the output for each.The generated chaotic sequence is implemented for encrypting and decrypting the image and text message

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.


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.


Author(s):  
Lionel Rosier

In this chapter, we consider a class of discrete dynamical systems defined on the homogeneous space associated with a regular tiling of RN, whose most familiar example is provided by the N-dimensional torus TN. It is proved that any dynamical system in this class is chaotic in the sense of Devaney, and that it admits at least one positive Lyapunov exponent. Next, a chaos-synchronization mechanism is introduced and used for masking information in a communication setup.


Sign in / Sign up

Export Citation Format

Share Document