Communication between Synchronized Random Number Generators

In most published chaos-based communication schemes, the system's parameters used as a key could be intelligently estimated by a cracker based on the fact that information about the key is contained in the chaotic carrier. In this paper, we will show that the least significant digits (LSDs) of a signal from a chaotic system can be so highly random that the system can be used as a random number generator. Secure communication could be built between the synchronized generators nonetheless. The Lorenz system is used as an illustration.

[1]  L. Kocarev.  Chaos-based cryptography: a brief overview , 2001 .

[2]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[3]  C Zhou,et al.  Decoding information by following parameter modulation with parameter adaptive control. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[4]  Christopher Essex,et al.  Measure of predictability. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Pei Yu,et al.  Steps towards improving the security of chaotic encryption. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Weiguang Yao,et al.  A NEW CHAOTIC SYSTEM FOR BETTER SECURE COMMUNICATION 1 , 2003 .

[7]  S Sundar,et al.  Synchronization of randomly multiplexed chaotic systems with application to communication. , 2000, Physical review letters.

[8]  W. Tucker.  The Lorenz attractor exists , 1999 .

[9]  A. Kolmogorov.  Three approaches to the quantitative definition of information , 1968 .

[10]  Parlitz,et al.  General approach for chaotic synchronization with applications to communication. , 1995, Physical Review Letters.

[11]  Ian Stewart,et al.  Mathematics: The Lorenz attractor exists , 2000, Nature.

[12]  X. Mou,et al.  Performance analysis of Jakimoski–Kocarev attack on a class of chaotic cryptosystems , 2003 .

[13]  Cuomo,et al.  Circuit implementation of synchronized chaos with applications to communications. , 1993, Physical review letters.

[14]  Yu Zhang,et al.  Synchronizing Chaos by impulsive Feedback Method , 2001, Int. J. Bifurc. Chaos.

[15]  Kevin M. Short,et al.  Steps Toward Unmasking Secure Communications , 1994 .

[16]  M. Baptista.  Cryptography with chaos , 1998 .

[17]  Pierre L'Ecuyer,et al.  Efficient and portable combined random number generators , 1988, CACM.

[18]  Parlitz,et al.  Driving and synchronizing by chaotic impulses. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[19]  H. Sakaguchi.  Parameter evaluation from time sequences using chaos synchronization. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  E. Lorenz.  Deterministic nonperiodic flow , 1963 .

[21]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[22]  Pérez,et al.  Extracting messages masked by chaos. , 1995, Physical review letters.

[23]  A. Fraser.  Reconstructing attractors from scalar time series: A comparison of singular system and redundancy criteria , 1989 .

[24]  Chongzhao Han,et al.  Modification for synchronization of Rossler and Chen chaotic systems , 2002 .

[25]  G. Gibbons,et al.  Stringy cosmic strings with horizons , 1990 .

[26]  Mees,et al.  Singular-value decomposition and embedding dimension. , 1987, Physical review. A, General physics.

[27]  Wei Huang,et al.  Unmasking Chaotic mask by a Wavelet Multiscale Decomposition Algorithm , 2001, Int. J. Bifurc. Chaos.

[28]  Ljupco Kocarev,et al.  Analysis of some recently proposed chaos-based encryption algo-rithms , 2001 .