Chaotic S-box Research Articles

A Watermarking Technique with Chaotic Fractional S-Box Transformation

In this paper, the system of non-linear ordinary differential equations which defines a continuous-time dynamical system that shows the fractal characteristics of attractor is used to construct chaotic S-box. In this new digital watermarking technique the priority is of importance of robustness along with chaos to create confusion. The inclusion of chaos along with watermarking in frequency domain ensures robustness. As we have proposed a frequency domain watermarking as which we embed watermark into the low or middle frequencies, these changes will be spread all over the image. The strength of fractional S-box is evaluated with the help of bit independence criterion, nonlinearity analysis, strict avalanche criterion, linear approximation probability and differential approximation probability. Additionally, some security analyses in the form of correlation, contrast, energy, entropy, homogeneity, mean square error and peak signal to noise ratio are performed for validity of proposed watermarking scheme. The confidence measure after these analyses indicates the survival aligned with malicious attacks like noise, cropping and compression.

S-box: six-dimensional compound hyperchaotic map and artificial bee colony algorithm

Being as unique nonlinear components of block ciphers,substitution boxes(S-boxes) directly affect the security of the cryptographic systems.It is important and difficult to design cryptographically strong S-boxes that simultaneously meet with multiple cryptographic criteria such as bijection,non-linearity,strict avalanche criterion(SAC),bits independence criterion(BIC),differential probability(DP) and linear probability(LP).To deal with this problem,a chaotic S-box based on the artificial bee colony algorithm(CSABC) is designed.It uses the S-boxes generated by the six-dimensional compound hyperchaotic map as the initial individuals and employs ABC to improve their performance.In addition,it considers the nonlinearity and differential uniformity as the fitness functions.A series of experiments have been conducted to compare multiple cryptographic criteria of this algorithm with other algorithms.Simulation results show that the new algorithm has cryptographically strong S-box while meeting multiple cryptographic criteria.

A novel image encryption scheme based on multiple chaotic S-boxes

In many encryption systems, the original data are transformed into encrypted version by applying nonlinear substitutions and inducing diffusion. The objective of the nonlinear transformation is to attain high levels of randomness in the cipher text. The choice of the source of randomness is critical because the success in cryptanalysis is demarked by the characteristics identified in the encrypted data. The chaotic systems show random behavior that is suitable for encryption applications where nonlinear transformations are required between plaintext and the encrypted data. The application of nonlinear functional chaos-based system with embedded chaotic system and multi-parameters can instigate randomness and diffusion in the data. In addition to high level of randomness, the need for multiple round keys is required in a typical substitution–permutation process. The proposed method eliminates the need for multiple round keys, which is suitable for high-speed communication systems. The statistical experiments performed on the proposed nonlinear transformation algorithms show improvement in encryption strength and resistance against many brute force and statistical attacks. In addition, the proposed system shows high resistance against differential and linear cryptanalysis.

A new implementation of chaotic S-boxes in CAPTCHA

A Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA) is a program that can generate and grade tests that humans can pass but current computer programs cannot. The humans can read distorted text as the one shown below, but current computer programs cannot. We have proposed a novel chaos-based CAPTCHA. We have utilized our proposed S-box and used chaotic iterative relation to select a completely random CAPTCHA for the security of web portal and other user interface multimedia where human interaction with the machine is verified.

A Novel Statistical Analysis of Chaotic S-box in Image Encryption

The S-box is utilized within different block ciphers and the complexity of encryption basically relies on the quality of S-box. The quality of S-box could be measured by breaking down its statistical properties. The S-box is the main non-linear component in different block ciphers fit for creating confusion. Numerous S-boxes have been proposed with comparative algebraic and statistical properties. Thusly, it is off and on again hard to pick S-box for a specific application. The performances of these S-boxes vary and rely on the way of information and their applications. In this paper; we have proposed a novel chaotic S-box by applying affine transformation to study their strengths in order to determine their suitability in image encryption. The proposed chaotic S-box is tested for different criterion such mean squared error, root mean squared error, mean absolute error, peak signal to noise ratio, signal-to-noise ratio, universal image quality index and enhancement error. The results of these analyses are further examined and are used to determine the appropriateness of S-box to image encryption applications. a–b Lena plain color image, Lena color encrypted image

Gray code permutation algorithm for high-dimensional data encryption

We present a novel permutation algorithm for fast encryption of a large amount of data, such as 3D images and real-time videos. The proposed P-Box algorithm takes advantage of Gray code properties and allows fast encryption with high information diffusion. The algorithm is optimized for integer q-bit operations (q=8,16,32,…), allowing a direct implementation in almost any hardware platform, while avoiding rounding errors of floating-point operations. By combining the P-Box with chaotic S-Box based on the logistic map, we design a complete, highly secure and fast cryptosystem.

Stego optical encryption based on chaotic S-box transformation

Abstract In this article, an optical image encryption algorithm with an information hiding technique is presented. In this algorithm, a secret image is implanted into the cover image. After that the stego-image is encrypted with the help of double random phase encoding algorithm and chaotic substitution box transformation. Also, we present a comparative analysis between images “without substitution box transformation”, “with substitution box transformation” and “with chaotic substitution box transformation”. Security test shows that image transform with chaotic substitution box transformation is better than others. Furthermore we analyze proposed encryption scheme with other existing techniques and come to close that our algorithm is better than others.

Construct and Analyze K-Hash Function Based on Chaotic Dynamic S-Boxes

By combining the traditional iteration structure of Hash function with the dynamic S-boxes, a novel keyed Hash function is presented. The proposed approach can give a chaotic Hash value by means of the lookup table of functions and chaotic dynamic S-box. Compared with the existing chaotic Hash functions, this method improves computational performance of Hash system by using the chaotic S-box substitution. Theoretical and experimental results show that the proposed method has not only strong one way property, sensitivity to initial conditions and chaotic system’s parameters, but also high speed.

Block encryption algorithm based on chaotic S-box for wireless sensor network

The pros and cons of the existing encryption algorithm for Wireless Sensor Network(WSN) were analyzed.A chaotic block cipher based on chaos box was proposed for WSN in accordance with its security request.Random number was generated by mainly using the chaotic aperiodicity,unpredictability and other related characteristics,and corresponding S box was designed by using random number.Finally,conclusion was made by comparing RC5 and RC6 at statistical performance and energy consumption.The results show this encryption scheme has better performance for WSN.

Designing chaotic S-boxes based on time-delay chaotic system

S-box structures used in the encryption architecture are of great importance for constructing powerful block encryption systems, which hold an important place in modern cryptology. The design of S-boxes with sound cryptographic characteristics is of utmost importance for constructing powerful encryption systems. In this study, an S-box design algorithm based on time-delay chaotic systems is proposed. The proposed algorithm is considered relative to other algorithms in the literature as more useful according to such criteria as simplicity and efficient implementation. Theoretical analysis and computer simulations demonstrated that the proposed algorithm meets all the performance requirements for the S-box design criteria, and also verified the efficient and practical structure of the algorithm.

Efficient method for designing chaotic S-boxes based on generalized Baker’s map and TDERC chaotic sequence

The theory of chaos is applied to the construction of substitution boxes used in encryption applications. The synthesis process of the proposed substitution boxes is presented, which is based on chaotic Baker’s map and TDERC chaotic sequences. The objectives of the new substitution box are to provide enhanced resistance against differential and linear cryptanalysis. The constructed substitution boxes uses Galois field elements and relies on discrete chaotic maps while keeping differential and linear approximation probabilities to desired levels.

Image encryption algorithm based on total shuffling scheme and chaotic S-box transformation

This paper presents an image encryption scheme based on complete shuffling algorithm: limited in the skew tent-map-predicated image cryptosystem and chaotic substitution box transformation. The proposed image encryption algorithm provides extra confusion due to the inclusion of a chaotic S-box. It is well known from the literature that simple image encryption based on a total shuffling scheme is not secure against a chosen cipher text attack. We then projected an extended algorithm which does well against a chosen cipher text attack. Furthermore we analyze the proposed technique for unified average changing intensity (UACI) and NPCR analysis to determine its strength.

A novel approach for designing substitution-boxes based on nonlinear chaotic algorithm

A substitution box (S-box) plays a central role in cryptographic algorithms. In this paper, an efficient method for designing S-boxes based on chaotic maps is proposed. The proposed method is based on the NCA (nonlinear chaotic algorithm) chaotic maps. The S-box so constructed has very optimal nonlinearity, bit independence criterion (BIC), strict avalanche criterion (SAC), differential and linear approximation probabilities. The proposed S-box is more secure against differential and linear cryptanalysis compared to recently proposed chaotic S-boxes.

Using Segment Number Parameter of Piecewise Linear Chaotic Map Construct Novel Hash Scheme

A novel keyed Hash function is presented based on the dynamic S-boxes. The proposed approach can give a chaotic Hash value by means of the lookup table of functions and chaotic dynamic S-box. Compared with the existing chaotic Hash functions, this method improves computational performance of Hash system by using the chaotic S-box substitution. Theoretical and experimental results show that the proposed method has not only strong one way property, sensitivity to initial conditions and chaotic system’s parameters, but also high speed.

A Novel Hash Scheme Based on SNP-PLCM

By combining the traditional iteration structure of Hash function with the dynamic S-boxes, a novel keyed Hash function is presented. The proposed approach can give a chaotic Hash value by means of the lookup table of functions and chaotic dynamic S-box. Compared with the existing chaotic Hash functions, this method improves computational performance of Hash system by using the chaotic S-box substitution. Theoretical and experimental results show that the proposed method has not only strong one way property, sensitivity to initial conditions and chaotic system's parameters, but also high speed.

Designing key-dependent chaotic S-box with larger key space

The construction of cryptographically strong substitution boxes (S-boxes) is an important concern in designing secure cryptosystems. The key-dependent S-boxes designed using chaotic maps have received increasing attention in recent years. However, the key space of such S-boxes does not seem to be sufficiently large due to the limited parameter range of discretized chaotic maps. In this paper, we propose a new key-dependent S-box based on the iteration of continuous chaotic maps. We explore the continuous-valued state space of chaotic systems, and devise the discrete mapping between the input and the output of the S-box. A key-dependent S-box is constructed with the logistic map in this paper. We show that its key space could be much larger than the current key-dependent chaotic S-boxes.

Efficient and Simple Method for Designing Chaotic S-Boxes

A substitution box (S-box) plays a central role in cryptographic algorithms. In this paper, an efficient method for designing S-boxes based on chaotic maps is proposed. The proposed method is based on the mixing property of piecewise linear chaotic maps. The S-box so constructed has very low differential and linear approximation probabilities. The proposed S-box is more secure against differential and linear cryptanalysis compared to recently proposed chaotic S-boxes.