Cryptography based on chaotic random maps with position dependent weighting probabilities

被引:8
作者
Behnia, S. [1 ]
Akhshani, A. [2 ]
Ahadpour, S. [3 ]
Akhavan, A. [4 ]
Mahmodi, H. [2 ]
机构
[1] IAU, Dept Phys, Orumiyeh, Iran
[2] Univ Sains Malaysia, Sch Phys, George Town 11800, Malaysia
[3] Mohaghegh Ardabili Univ, Dept Phys, Ardebil, Iran
[4] Univ Sains Malaysia, Sch Comp Sci, George Town 11800, Malaysia
关键词
INVARIANT-MEASURES; SYSTEMS; SYNCHRONIZATION; CRYPTOSYSTEM; HIERARCHY; DENSITIES; STABILITY; CIPHER;
D O I
10.1016/j.chaos.2007.07.070
中图分类号
O1 [数学];
学科分类号
070101 [基础数学];
摘要
Chaotic cryptology has been widely investigated recently. A common feature in the most recent developments of chaotic cryptosystems is the use of a single dynamical rule in the encoding-decoding process. The main objective of this paper is to provide a set of chaotic systems instead of a single one for cryptography. In this paper, we introduce a chaotic cryptosystem based oil the symbolic dynamics of random maps with position dependent weighting probabilities. The random maps model is a deterministic dynamical system in a finite phase space with n points. The maps that establish the dynamics of the system are chosen randomly for every point. The essential idea of this paper is that, given two dynamical systems that behave in a certain way, it is possible to combine them (by composing) into a new dynamical system. This dynamically composed system behaves in a completely different way compared to the constituent Systems. The proposed scheme exploits the symbolic dynamics of a set of chaotic maps in order to encode the binary information. The performance of the new cryptosystem based oil chaotic dynamical systems properties is examined. Both theoretical and experimental results demonstrate that the proposed algorithm using symbolic dynamics achieves the optimal security criteria. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:362 / 369
页数:8
相关论文
共 43 条
[1]
Abramowitz M., 1972, HDB MATH FUNCTIONS
[2]
[Anonymous], 1998, Applied Symbolic Dynamics and Chaos
[3]
[Anonymous], INTRO SYMBOLIC DYNAM
[4]
[Anonymous], 1997, LAWS CHAOS INVARIANT, DOI DOI 10.1007/978-1-4612-2024-4
[5]
[Anonymous], SYMBOLIC DYNAMICS
[6]
[Anonymous], 1964, INT BUSINESS
[7]
Markov switching for position dependent random maps with application to forecasting [J].
Bahsoun, W ;
Góra, P ;
Boyarsky, A .
SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS, 2005, 4 (02) :391-406
[8]
Barnsley Michael F, 1998, FRACTALS EVERYWHERE
[9]
A novel algorithm for image encryption based on mixture of chaotic maps [J].
Behnia, S. ;
Akhshani, A. ;
Mahmodi, H. ;
Akhavan, A. .
CHAOS SOLITONS & FRACTALS, 2008, 35 (02) :408-419
[10]
A fast chaotic encryption scheme based on piecewise nonlinear chaotic maps [J].
Behnia, S. ;
Akhshani, A. ;
Ahadpour, S. ;
Mahmodi, H. ;
Akhavan, A. .
PHYSICS LETTERS A, 2007, 366 (4-5) :391-396