scholarly journals PROBLEMS WITH A PROBABILISTIC ENCRYPTION SCHEME BASED ON CHAOTIC SYSTEMS

2003 ◽  
Vol 13 (10) ◽  
pp. 3063-3077 ◽  
Author(s):  
SHUJUN LI ◽  
XUANQIN MOU ◽  
BOLIYA L. YANG ◽  
ZHEN JI ◽  
JIHONG ZHANG
Keyword(s):  
State Space ◽  
Chaotic Systems ◽  
Virtual State ◽  
Permutation Matrix ◽  
Practical Implementation ◽  
Encryption Scheme ◽  
High Security ◽  
Dynamical Degradation ◽  
Probabilistic Encryption ◽  
Practical Security

Recently S. Papadimitriou et al. have proposed a new probabilistic encryption scheme based on chaotic systems. In this letter, we point out some problems with Papadimitriou et al.'s chaotic cryptosystem: (1) the size of the ciphertext and the plaintext cannot simultaneously ensure practical implementation and high security; (2) the estimated number of all possible virtual states is wrong; (3) the practical security to exhaustive attack is overestimated; (4) the fast encryption speed is dependent on the first defect; (5) problems about the dynamical degradation of digital chaotic systems; (6) no explicit indications are given to explain how to construct the virtual state space with the 2d virtual attractors, the 2e virtual states and the permutation matrix P. The detailed analyses and discussions on the above problems show that the proposed chaotic cipher is insecure and unpractical. Also, we give our suggestions on the design of general digital chaotic ciphers, and give some open topics in this area.

A PROBABILISTIC SYMMETRIC ENCRYPTION SCHEME FOR VERY FAST SECURE COMMUNICATION BASED ON CHAOTIC SYSTEMS OF DIFFERENCE EQUATIONS

2001 ◽  
Vol 11 (12) ◽  
pp. 3107-3115 ◽  
Author(s):  
S. PAPADIMITRIOU ◽  
T. BOUNTIS ◽  
S. MAVROUDI ◽  
A. BEZERIANOS
Keyword(s):  
State Space ◽  
Difference Equations ◽  
Secure Communication ◽  
Chaotic Dynamics ◽  
Chaotic Systems ◽  
Virtual State ◽  
Encryption Scheme ◽  
System Of Difference Equations ◽  
Symmetric Key ◽  
Transmitted Symbol

We present a new probabilistic symmetric key encryption scheme based on the chaotic dynamics of properly designed chaotic systems. This technique exploits the concept of virtual attractors, which are not real attractors of the underlying chaotic dynamics but are created and maintained artificially. Each virtual attractor represents a symbol of the alphabet used to encode messages. The state space is partitioned over the virtual attractors creating clusters of states. The enciphering process randomizes over the set of states mapped to a virtual attractor in order to construct the ciphertext for the transmited symbol. The receiver can reconstruct perfectly this virtual state space, given the possession of the same chaotic system of difference equations with parameters tuned perfectly to those of the transmitter. Therefore, from the ciphertext chunk corresponding to a state, the virtual attractor can be derived from the details of the virtual state space. The knowledge of the virtual attractor leads to the recovery of the transmitted symbol. We demonstrate that the new algorithm is secure, reliable and very fast. It uses discrete time chaotic recurrent systems and is simple, flexible and modular. These systems can be constructed easily dynamically from an alphanumeric encryption key. The cryptographic security of the algorithm is evaluated with combinatorial arguments.

Mixed Strategy Global Sub-Optimal Feedback Control for Chaotic Systems

1997 ◽  
Vol 07 (03) ◽  
pp. 607-623 ◽  
Author(s):  
H. W. J. Lee ◽  
M. Paskota ◽  
K. L. Teo
Keyword(s):  
Feedback Control ◽  
State Space ◽  
Chaotic Systems ◽  
Mixed Strategy ◽  
The State ◽  
Optimal Feedback Control ◽  
Target Region ◽  
Optimal Feedback ◽  
Control Scheme

How to perform targeting of chaotic systems in a global sense is an important question. In this paper, we address this problem by introducing a mixed strategy global sub-optimal feedback control scheme. The idea is to partition the state space into 2 parts, namely, the target region and its complement. The proposed controller will take different forms depending on which partition of the state space the system is in. Simulations are also provided to illustrate the proposed scheme.

scholarly journals A Novel and Efficient 3D Multiple Images Encryption Scheme Based on Chaotic Systems and Swapping Operations

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 123536-123555 ◽  
Author(s):  
Muhammad Hanif ◽  
Rizwan Ali Naqvi ◽  
Sagheer Abbas ◽  
Muhammad Adnan Khan ◽  
Nadeem Iqbal
Keyword(s):  
Chaotic Systems ◽  
Encryption Scheme ◽  
Multiple Images

Implementation of a Double Sequence Encryption Scheme Based on Chaotic Map

2013 ◽  
Vol 765-767 ◽  
pp. 1073-1076
Author(s):  
Fu Xiang Zhao
Keyword(s):  
Change Detection ◽  
Chaotic Map ◽  
Double Sequence ◽  
Time Sequence ◽  
Practical Implementation ◽  
Encryption Scheme ◽  
Theoretical Evaluation ◽  
Disk Encryption ◽  
Provably Secure ◽  
Full Disk

this paper presents a new scheme for enhancing the security of full disk encryption relying on the double sequence encryption based on chaotic map in order to improve the performance of its practical implementation. The aims of the proposed scheme are to design a keystream generator for the tweakable enciphering mode in space or time sequence using the real-time embedded device through sequential change detection on the disk read-and-write request. This design of the scheme is based on re-keying principle and derived from information-theoretical evaluation. Analyses show that the scheme is provably secure and can prevent inner and outer attackers from attacking. To the best of our knowledge, the scheme offers the first comprehensive solution to the watermarking attack in the same sector.

Sign in / Sign up

Export Citation Format

Share Document