Safya Belghith

A novel image encryption scheme based on substitution-permutation network and chaos

In this paper, a novel image encryption approach based on permutation-substitution (SP) network and chaotic systems is proposed. It consists of four cryptographic phases: diffusion, substitution, diffusion and permutation. Firstly, a diffusion phase is proposed based on new chaotic map. Then, a substitution phase based on strong S-boxes followed by a diffusion phase based on chaotic logistic map are presented which will, in turn, significantly increase the encryption performance. Finally, a block permutation phase is accomplished by a permutation function to enhance the statistical performance of the proposed encryption approach. Conducted experiments based on various types of differential and statistical analyses show that the proposed encryption approach has high security, sensitivity and speed compared to previous approaches A novel image encryption approach based on SP network and chaos is proposed.Qualitative and quantitative analysis verify the effectiveness of the proposed encryption scheme.The encryption scheme shows superior performance than previous schemes.

Security analysis of an image encryption algorithm based on a DNA addition combining with chaotic maps

In this paper, we propose to cryptanalyse an encryption algorithm which combines a DNA addition and a chaotic map to encrypt a gray scale image. Our contribution consists on, at first, demonstrating that the algorithm, as it is described, is non-invertible, which means that the receiver cannot decrypt the ciphered image even if he posses the secret key. Then, a chosen plaintext attack on the invertible encryption block is described, where, the attacker can illegally decrypt the ciphered image by a temporary access to the encryption machinery.

Security analysis of image cryptosystems only or partially based on a chaotic permutation

The paper proposes breaks for the permutation methods adopted in the chaos-based image cryptosystems. By a careful examination on the most chaotic image cryptosystems we can find that the permutation process constitute the main step or, in some cases, the only step to create the confusion. It can be applied on the pixels or on the pixel bits. A recently proposed image encryption scheme based on shuffling the pixel bits inspired from other works is treated as a case study. By applying a chosen plaintext attack, we demonstrate that a hacker can determine the permutation vectors (matrixes) used to permute the pixels bits or the pixels themselves and exploit them to reveal the plain image.

Improvement of an image encryption algorithm based on hyper-chaos

In this paper, we propose to enhance a recently proposed image cryptosystem based on hyper-chaos. The updated version has been builded to resist against attacks made to break the original one and to make it faster. The modification concerns the two Boxes, P-Box and S-Box, which composed the original cryptosystem. Compared with classical encryption schemes, AES and Triple-DES, the new version of the cipher shows a better performances in rapidity, in confusion and in the key sensitivity.

Breaking an image encryption scheme based on a spatiotemporal chaotic system

In this paper, we describe a cryptanalysis of image encryption scheme recently proposed by Chun-Yan Song, Yu-Long Qiao, and Xing-Zhou Zhang. The scheme is based on a spatiotemporal chaos with a dynamic keystream generator, and its security is claimed to rely in utilized the plainimage in the keystream generation process to obtain a different keystream for every plainimage/cipherimage pair. However, two flaws are investigated and prove that the security of the proposal against chosen plaintext attack is groundless. Simulations conducted demonstrate that the plainimage can be recovered under partial attack with an acceptable perceptual quality. Moreover, a total break is possible, but a large number of plain-image/cipher-image pairs is needed. HighlightsA cryptanalysis of an image encryption scheme based on spatiotemporal chaos is presented.We gave a complete and partial break of the cryptosystem under study.We prove that the studied cryptosystem is not sufficiently secure against chosen plaintext attack.Results suggest that a partial attach needs smaller number of plain/ciphered images with acceptable perceptual qualities.

INTERMITTENCY AND INTERIOR CRISIS AS ROUTE TO CHAOS IN DYNAMIC WALKING OF TWO BIPED ROBOTS

Recently, passive and semi-passive dynamic walking has been noticed in researches of biped walking robots. Such biped robots are well-known that they demonstrate only a period-doubling route to chaos while walking down sloped surfaces. In previous researches, such route was shown with respect to a continuous change in some parameter of the biped robot. In this paper, two biped robots are introduced: the passive compass-gait biped robot and the semi-passive torso-driven biped robot. The period-doubling scenario route to chaos is revisited for the first biped as the ground slope changes. Furthermore, we will show through bifurcation diagram that the torso-driven biped exhibits also such route to chaos when the slope angle is varied. For such biped, a modified semi-passive control law is introduced in order to stabilize the torso at some desired position. In this work, we will show through bifurcation diagrams that the dynamic walking of the two biped robots reveals two other routes to chaos namely the intermittency route and the interior crisis route. We will stress that the intermittency is generated via a saddle-node bifurcation where an unstable periodic orbit is created. We will highlight that such event takes place for a Type-I intermittency. However, we will emphasize that the interior crisis event occurs when a collision of the unstable periodic orbit with a weak chaotic attractor happens giving rise to a strong chaotic attractor. In addition, we will explore the intermittent step series induced by the interior crisis and also by the Type-I intermittency. In this study, our analysis on chaos and the routes to chaos will be based, beside bifurcation diagrams, on Lyapunov exponents and fractal (Lyapunov) dimension. These two tools are plotted in the parameter space to classify attractors observed in bifurcation diagrams.

CYCLIC-FOLD BIFURCATION AND BOUNDARY CRISIS IN DYNAMIC WALKING OF BIPED ROBOTS

The aim of this paper is to show that the onset/destruction of bipedal chaos in the dynamic walking of a passive compass-gait biped robot and a semi-passive torso-driven biped robot walking down a slope can occur via a transition mechanism known as boundary crisis. It is known that such biped robots exhibit a scenario of period-doubling bifurcations route to chaos as one of their geometrical or inertial parameters changes. In this paper, we show that a cyclic-fold bifurcation is the key of the occurrence of a double boundary crisis. We demonstrate through bifurcation diagrams how the same period-three unstable periodic orbit generated from the cyclic-fold bifurcation causes the sudden birth/death of the bipedal chaos in the dynamic walking of the two biped robots. We stress that a double boundary crisis is responsible for the fall of each biped robot while walking down an inclined surface and as some bifurcation parameter varies. Stability of the cyclic-fold bifurcation under small perturbations is also discussed.

A new color image cryptosystem based on a piecewise linear chaotic map

In this paper a piecewise linear chaotic map (PWLCM) is used to build a new digital chaotic cryptosystem. The characteristics of PWLCM are very suitable for the design of encryption schemes. The implicit digital degradation problem of PWLCM has been eluded through the discretization of the phase space. The accuracy, efficiency and security of the proposed encryption scheme is thoroughly analyzed and its adequacy for image encryption is proved.

Continuously-implemented sliding-mode adaptive unknown-input observers under noisy measurements

We propose an estimator for nonlinear systems with unmatched unknown inputs and under measurement noise. The estimator design is based on the combination of observer design for descriptor systems, sliding-modes theory and adaptive control. The estimation of the measurement noise is achieved thanks to the transformation of the original system into a singular form where the measurement noise makes part of the augmented state. Two adaptive parameters are updated online, one to compensate for the unknown bounds on the states, the unknown inputs and the measurement noise and a second one to compensate for the effect of the nonlinearities. To join robust state estimation and unknown-inputs reconstruction, our approach borrows inspiration from sliding-mode theory however, all signals are continuously implemented. We demonstrate that both state and unknown-inputs estimation are achieved up to arbitrarily small tolerance. The utility of our theoretical results is illustrated through simulation case-studies.

Chaotic watermark for blind forgery detection in images

In this paper, a new chaos based watermarking scheme for effective tamper detection in images is proposed. The proposed scheme is able to detect any possible forgery and spot the areas which have been tampered. To improve the efficiency of the proposed scheme, a binary watermark is constructed from the image itself, which makes the watermark unique for every image and guarantee the blindness in the detection process. To guarantee the security of the proposed scheme, chaotic maps are used to complicate the embedding and the detection process to reduce the vulnerability to different attacks. Experimental results and security analysis show that the proposed scheme achieves superior tamper detection under common attacks.