Dynamic Substitution Box Research Articles

ECM: Enhanced confidentiality method to ensure the secure migration of data in VM to cloud environment

Cloud is the technology behind all modern IT paradigms today. All kinds of applications run in the cloud environment and host their data. Enterprises show interest in migrating their data and servers to the cloud to benefit the cloud. The cloud is an open distributed network environment; hence, it is vulnerable to data security attacks. Migration in cloud computing permits the handover of resources, for example, virtual machine (VM) and data from off-premises to on-premises. During the migration, the data needs to be secured. This paper proposes an enhanced confidentiality technique (ECM) to ensure data security when migrated to the cloud. The proposed enhancement is on the advanced encryption standard (AES) to strengthen the protection level of the AES. The standard AES runs for rounds with four unique stages of data processing: Substitute bytes, add round key, shift rows and mix columns. The proposed ECM enhances the substitute bytes stage with dynamic substitution boxes for each round of the AES. The proposed ECM is evaluated for its efficiency by the avalanche effect. The result of the ECM improves data protection when the data is migrated to the cloud.

Multichannel image encryption using dynamic substitution and JSMP map

The confidentiality of images is crucial in medical, military, satellite, and IoT fields. Encipherment ensures confidentiality, relying on strong Substitution boxes (S-boxes) and Permutation boxes (P-boxes). Dynamic S-boxes prevent fixed weak points, while randomness weakens pixel correlations. Numerous techniques are proposed in the field but are highly complex or complicated. This paper presents a simplified approach for constructing a robust dynamic S-box that utilizes the properties of modular arithmetic and JoanS-MuraliP’s (JSMP) chaotic map. Several tests were performed that proved that the suggested S-box is highly non-linear and has strict avalanche criterion (SAC) value above 0.5. Additionally, a powerful encipherment system is proposed, utilizing dynamic substitution boxes and JSMP chaotic map. Dynamic substitutions and permutations are applied separately to the image’s red, green, and blue channels. Experimental results demonstrate resistance to statistical and differential attacks, outperforming advanced algorithms with a simpler design. The system achieves 100 % NPCR across all channels, a benchmark typically only reached by complex systems. Comparative analysis validates the proposed algorithm’s efficacy over established methods.

A novel deterministic substitution box generator over elliptic curves for real-time applications

Recently, highly dynamic substitution box (S-box) generators are widely used in cryptosystems to improve the security against modern computational attacks. However, generating S-boxes is computationally costly, and frequently generating them slows down the encryption process and hence limits the encryption throughput. This fact necessitates developing new S-box generators that can provide optimal security with minimum computation cost. We propose a novel S-box generator based on a deterministic algorithm over elliptic curves to generate highly dynamic and secure S-boxes with low computation cost. Experimental results show that our generator is i times, i∈[6.720,1.3×105] faster than the fastest available S-box generator to generate S-boxes of an input size 2m,m=4,6,8,10,12,14,16 over large ECs. This fact allows us to attain significantly higher throughput as compared to the state-of-the-art schemes. Furthermore, our generator can generate highly dynamic, key-sensitive, and cryptographically secure S-boxes. As a sample application, we used our generator in an image encryption scheme. Experimental results reveal that our encryption scheme has high resistance against differential and statistical attacks, and key attacks. Furthermore, with the new S-box generator, the running time of the modified scheme reduced by two orders of magnitude.

Dynamic S-Box and PWLCM-Based Robust Watermarking Scheme

Due to the increased number of cyberattacks, numerous researchers are motivated towards the design of such schemes that can hide digital information in a signal. Watermarking is one of the promising technologies that can protect digital information. However, traditional watermarking schemes are either slow or less secure. In this paper, a dynamic S-Box based efficient watermarking scheme is presented. The original image was extracted at the receiver’s end without any loss of sensitive information. Firstly, the Secure Hash Algorithm is applied to the original image for the generation of the initial condition. Piece Wise Linear Chaotic Map is then used to generate 16 times 16 dynamic Substitution Box (S-Box). As an additional security feature, the watermark is substituted through dynamic S-Box. Hence, it is hard for the eavesdroppers to attack the proposed scheme due to the dynamic nature of S-Box. Lastly, lifting wavelet transform is applied to the host image and the High Low and High High blocks of host image are replaced with least significant bits and most significant bits of the substituted watermark, respectively. Robustness, efficiency and security of the proposed scheme is verified using Structure Similarity Index, Structure Dissimilarity Index, Structure Content, Mutual Information, energy, entropy, correlation tests and classical attacks analysis.

A novel image encryption scheme based on pseudo-random coupled map lattices with hybrid elementary cellular automata

In this paper, a hybrid elementary cellular automata (HECA) composed of two chaotic global rules is designed to enhance the chaotic properties of the pseudo-random coupled map lattices (PRCML) model based on the Chirikov standard map (CSM). Theory analyses and simulations indicate that the PRCML-HECA model exhibits superior chaos. Subsequently, a novel image encryption scheme based on this model is implemented. The scheme consists of key seed generation, encryption, and decryption. A series-wound PRCML-HECA model is designed to generate the key seed related to the plain-image, initial key, and timestamp. This process is nonlinear and irreversible, ensuring the proposed scheme can resist the chosen-plaintext/ciphertext attacks. Furthermore, a dynamic substitution box changed with the key seed is also included in the proposed scheme. Moreover, plenty of statistical and security analyses, such as diffusion, histogram, correlation analyses, etc., are introduced in this paper. The results prove that the proposed image encryption scheme based on the PRCML-HECA model can resist differential and statistical attacks. And the scheme also possesses strong robustness and high efficiency.

Designing an Efficient and Highly Dynamic Substitution-Box Generator for Block Ciphers Based on Finite Elliptic Curves

Developing a substitution-box (S-box) generator that can efficiently generate a highly dynamic S-box with good cryptographic properties is a hot topic in the field of cryptography. Recently, elliptic curve (EC)-based S-box generators have shown promising results. However, these generators use large ECs to generate highly dynamic S-boxes and thus may not be suitable for lightweight cryptography, where the computational power is limited. The aim of this paper is to develop and implement such an S-box generator that can be used in lightweight cryptography and perform better in terms of computation time and security resistance than recently designed S-box generators. To achieve this goal, we use ordered ECs of small size and binary sequences to generate certain sequences of integers which are then used to generate S-boxes. We performed several standard analyses to test the efficiency of the proposed generator. On an average, the proposed generator can generate an S-box in 0.003 seconds, and from 20,000 S-boxes generated by the proposed generator, 93 % S-boxes have at least the nonlinearity 96. The linear approximation probability of 1000 S-boxes that have the best nonlinearity is in the range [0.117, 0.172] and more than 99% S-boxes have algebraic complexity at least 251. All these S-boxes have the differential approximation probability value in the interval [0.039, 0.063]. Computational results and comparisons suggest that our newly developed generator takes less running time and has high security against modern attacks as compared to several existing well-known generators, and hence, our generator is suitable for lightweight cryptography. Furthermore, the usage of binary sequences in our generator allows generating plaintext-dependent S-boxes which is crucial to resist chosen-plaintext attacks.

DYNAMIC SUBSTITUTION BOXES OF SYMMETRIC BLOCK ENCRYPTION ALGORITHMS

The paper deals with nonlinear transformations of well-known symmetric block algorithms such as AES, Kuznyechik, SM4, BelT, and Kalyna. A brief description of the substitution boxes for these algorithms is given. The properties of nonlinearity of the described substitution boxes are investigated with the calculation of the corresponding values. Based on the property of nonlinearity, a method for generating a dynamic substitution box is proposed. The purpose of this method is to generate dynamic substitution boxes (S-boxes) that change depending on the values of some parameter obtained from the secret key of the algorithm. Considering that linear and differential cryptanalysis uses known substitution boxes, the main advantage of the new method is that S-boxes are randomly key-dependent and unknown. Experiments were also carried out to implement this method. The resulting dynamic substitution boxes were tested for nonlinearity and the results were compared with the original nonlinearity values of the same substitution boxes.

A Truly Dynamic Substitution Box Generator for Block Ciphers Based on Elliptic Curves Over Finite Rings

Several dynamic substitution box (S-box) generators have been proposed in recent years. Some of the existing S-box generators can generate an S-box with good cryptographic properties. However, no analysis has been performed for almost all generators to confirm if they can output highly dynamic S-boxes in a reasonable computational complexity. This article aims to propose an S-box generator that can efficiently generate highly dynamic S-boxes with good cryptographic properties. For this purpose, we use elliptic curves over finite rings. To create randomness in the points on the curves, we define two families of total orders. We then use these ordered curves to generate an S-box of size m using the y-coordinates of an ordered subset of size m of the underlying curve. We performed a rigorous analysis to show that our proposed generator can efficiently generate dynamic S-boxes with good cryptographic properties. Compared to some of the existing generators, it is shown that the proposed S-box generator is more suitable for cryptographic purposes.

A Plaintext-Related Image Encryption Algorithm Based on Compressive Sensing and a Novel Hyperchaotic System

In this paper, an image encryption algorithm based on compressive sensing (CS) and a hyperchaotic system is proposed. This new two-dimensional logical coupling sine chaotic map (2D-LCSCM) has a wider range of chaos, better ergodicity and hyperchaotic properties rather than for existing chaotic maps. By combining with the novel chaotic map and CS, we design an image compression encryption algorithm with good reconstruction accuracy and high security. In the substitution phase of the encryption process, the security performance of the algorithm is improved by the nonlinear transformation of the dynamic substitution box (S-box) and the linear transformation of the chaotic sequences. The performance analyses of the experimental results show that the proposed algorithm can resist various attacks and is highly secure.

Efficient key-dependent dynamic S-boxes based on permutated elliptic curves

Key-dependent dynamic substitution boxes (S-boxes) are important building blocks of many image encryption schemes, in which a session key controls the construction of dynamic S-boxes. Frequently changing the dynamic S-boxes is necessary to improve security. However, the computational overhead of dynamic S-box construction limits the achievable encryption throughput. Therefore, minimizing the construction time of dynamic S-boxes is required. In this paper, we exploit key-dependent permutations over finite elliptic curves to present a novel computationally efficient method for dynamic S-box construction. Theoretical analysis shows that the proposed S-box construction method is immune to chosen-plaintext attacks. Analysis of an image encryption application using the proposed key-dependent S-box indicates resistance to statistical, related key, and chosen-plaintext attacks. Experimental results show that the proposed method is asymptotically an order-of-magnitude faster than relevant methods. A dynamic S-box with 512-bit key can be generated by the proposed method in 0.76 ms, paving the way to reach 1 GB/s encryption throughput. Results show that the generated S-boxes satisfy the standard S-box security criteria and have a competitive nonlinearity distribution compared with rival methods.

Improved 2D Discrete Hyperchaos Mapping with Complex Behaviour and Algebraic Structure for Strong S-Boxes Generation

This paper proposes to present a novel method of generating cryptographic dynamic substitution-boxes, which makes use of the combined effect of discrete hyperchaos mapping and algebraic group theory. Firstly, an improved 2D hyperchaotic map is proposed, which consists of better dynamical behaviour in terms of large Lyapunov exponents, excellent bifurcation, phase attractor, high entropy, and unpredictability. Secondly, a hyperchaotic key-dependent substitution-box generation process is designed, which is based on the bijectivity-preserving effect of multiplication with permutation matrix to obtain satisfactory configuration of substitution-box matrix over the enormously large problem space of 256!. Lastly, the security strength of obtained S-box is further elevated through the action of proposed algebraic group structure. The standard set of performance parameters such as nonlinearity, strict avalanche criterion, bits independent criterion, differential uniformity, and linear approximation probability is quantified to assess the security and robustness of proposed S-box. The simulation and comparison results demonstrate the effectiveness of proposed method for the construction of cryptographically sound S-boxes.

A fast and secure public-key image encryption scheme based on Mordell elliptic curves

Encryption schemes based on elliptic curves (ECs) have shown high resistance against modern cryptanalysis. However, these schemes involve heavy computation for the generation of points over ECs, and therefore they are not suitable for communication systems such as sensor networks and Internet of Things. Thus, we propose a fast and secure public-key image encryption scheme. In this scheme, the sender and receiver agree on a public EC. Then the scheme performs pixel-masking and pixel-scrambling procedures using random numbers and a dynamic substitution box over ECs that are isomorphic to the public EC. For a fixed public EC, we prove that our scheme has a computational complexity that is a polylogarithmic function of the size of the plain text. In other words, the computational complexity of our scheme is independent of the point generation over ECs. We tested the security of our scheme against modern attacks by encrypting all standard images in the USC-SIPI image database. Compared to some state-of-the-art cryptosystems, our scheme is fast and has high security.

Data Security System of Text Messaging Based on Android Mobile Devices Using Advanced Encrytion Standard Dynamic S-BOX

Most of the recent technologies are turning to mobile platforms, Android becames one of the most widely used OS. Eventhough it has complete features, even it's not safe enough such like Chat Messenger. The security of messages distribution is a challenge to increase of vulnerable distribution of information through the network today. Therefore, a data security or cryptographic algorithm is needed to secure the messages so that it cannot be read by irresponsible people. National Institute of Standard and Technology (NIST) established the Advanced Encrytion Standard (AES) cryptographic algorithm as a standard encryption algorithm that is safe and can be used globally. AES algorithm is included in block cipher cryptography that uses substitution boxes (S-BOX) in its operations, so that algorithmically can make input and output unrelated. So, it can provide more varied output in the process, we need a dynamic S-BOX. In this research, dynamic S-BOX generalized using XOR operations from affine transformations with 8-bit binary element matrices arranged and randomly to produce as many as 256 S-Boxes. The application of dynamic AES with S-BOX algorithm on Android-based messenger chat application is built using the Java programming language and database hierarchy for data storage. The implementation results showed that the algorithm was running well and could encrypt the text of the message to ciphertext and decrypt the ciphertext to the original message. This research can be used as a reference so that further researchers can merge the AES algorithm with other algorithms to improve the security of encryption in text files, documents, images, videos or other types of files.

Evolving Dynamic S-Boxes Using Fractional-Order Hopfield Neural Network Based Scheme.

Static substitution-boxes in fixed structured block ciphers may make the system vulnerable to cryptanalysis. However, key-dependent dynamic substitution-boxes (S-boxes) assume to improve the security and robustness of the whole cryptosystem. This paper proposes to present the construction of key-dependent dynamic S-boxes having high nonlinearity. The proposed scheme involves the evolution of initially generated S-box for improved nonlinearity based on the fractional-order time-delayed Hopfield neural network. The cryptographic performance of the evolved S-box is assessed by using standard security parameters, including nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, etc. The proposed scheme is able to evolve an S-box having mean nonlinearity of 111.25, strict avalanche criteria value of 0.5007, and differential uniformity of 10. The performance assessments demonstrate that the proposed scheme and S-box have excellent features, and are thus capable of offering high nonlinearity in the cryptosystem. The comparison analysis further confirms the improved security features of anticipated scheme and S-box, as compared to many existing chaos-based and other S-boxes.

Image Encryption Using Elliptic Curves and Rossby/Drift Wave Triads.

We propose an image encryption scheme based on quasi-resonant Rossby/drift wave triads (related to elliptic surfaces) and Mordell elliptic curves (MECs). By defining a total order on quasi-resonant triads, at a first stage we construct quasi-resonant triads using auxiliary parameters of elliptic surfaces in order to generate pseudo-random numbers. At a second stage, we employ an MEC to construct a dynamic substitution box (S-box) for the plain image. The generated pseudo-random numbers and S-box are used to provide diffusion and confusion, respectively, in the tested image. We test the proposed scheme against well-known attacks by encrypting all gray images taken from the USC-SIPI image database. Our experimental results indicate the high security of the newly developed scheme. Finally, via extensive comparisons we show that the new scheme outperforms other popular schemes.

Framework for Efficient Medical Image Encryption Using Dynamic S-Boxes and Chaotic Maps

Protecting patient privacy and medical records is a legal requirement. Traditional encryption methods fall short of handling the large volume of medical image data and their peculiar statistical properties. In this paper, we propose a generic medical image encryption framework based on a novel arrangement of two very efficient constructs, dynamic substitution boxes (S-boxes) and chaotic maps. The arrangement of S-box substitution before and after chaotic substitution is shown to successfully resist chosen plaintext and chosen ciphertext attacks. Special precautions are taken to fend off the reset attack against pseudorandom number generators. We show how to implement the generic framework using any key-dependent dynamic S-box construction method and any chaotic map. Experimental results show that the proposed framework successfully passes all security tests regardless of the chaotic map used for implementation. Based on speed analysis, we recommend the use of the classical Baker map or Henon map to achieve encryption throughput approaching 90 MB/s on a modern PC without hardware acceleration.

A novel pseudo-random coupled LP spatiotemporal chaos and its application in image encryption**Project supported by the National Natural Science Foundation of China (Grant Nos. 61672124, 61370145, and 61173183), the Password Theory Project of the 13th Five-Year Plan National Cryptography Development Fund, China (Grant No. MMJJ20170203), the Program for New Century Excellent Talents in Fujian Province University, and the Natural Science

In this paper, first, we investigate a novel one-dimensional logistic-PWLCM (LP) modulation map which is derived from the logistic and PWLCM maps. Second, we propose a novel PCLML spatiotemporal chaos in pseudo-random coupling method that can accelerate the system behavior of the fully spatial chaos. Here, because the better chaotic properties include a wide range of parameter settings and better ergodicity than a logistic map, the LP is used in PCLML as f(x). The Kolmogorov–Sinai entropy density and universality and the bifurcation diagram are employed to investigate the chaotic behaviors of the proposed PCLML model. Finally, we apply the LP and PCLML chaotic systems to image encryption to improve the effectiveness and security of the encryption scheme. By combining self-generating matrix model M and dynamic substitution box (S-Box) methods, we design a new image encryption algorithm. Numerical simulations and security analysis have been carried out to demonstrate that the proposed algorithm has a high security level and can efficiently encrypt several different kinds of images into random-like images.

Generating dynamic S-BOX based on Particle Swarm Optimization and Chaos Theory for AES

Data security is a significant requirement in our time. As a result of the rapid development of unsecured computer networks, the personal data should be protected from unauthorized persons and as a result of exposure AES algorithm is subjected to theoretical attacks such as linear attacks, differential attacks, and practical attacks such as brute force attack these types of attacks are mainly directed at the S-BOX and since the S-BOX table in the algorithm is static and no dynamic so this is a major weakness for the S-BOX table, the algorithm should be improved to be impervious to future dialects that attempt to analyse and break the algorithm in order to remove these weakness points, Will be generated dynamic substitution box (S-BOX) base on the input key, shifting, chaotic theory (1D, 2D logistic map), and particle swarm algorithm. At the same time will be generated inverse of the table S-BOX through output of the S-BOX which will be generated from the suggestions above will return the values of the union of the row and the column for all the values generated for S-BOX. The S-BOX output is tested in several measurements represent (complexity, time, avalanche criterion, and balance) and the results show that any change in the input will change the output S-BOX also the proposed algorithm will be measured by the five statistical and NIST measurements all results will show a successful exception random excursions, random excursions variant (test not application ). The time needed to implement it requires only milliseconds and is approximated to the time taken for the original algorithm.

Effect of Variations in the Population Size and Generations of Genetic Algorithms in Cryptography – An Empirical Study

Objectives: The implementation of Genetic algorithm in the symmetric block cipher Advanced Encryption Standard -128 (AES-128) algorithms to enhance the performance of cryptographic operations. Methods: Genetic algorithm is used for generating the best fit non-repetitive cipher key and for key distribution to design a dynamic Substitution box in AES-128. Findings: The study reveals that the efficiency of the cryptographic algorithm treated with Genetic algorithm is dependent on the variations in the number of generations and initial population size. The result shows that an optimum population size has less encryption and decryption time. Among the sample population size taken for the experiment, almost the average population size has minimum encryption and decryption time. Results from iteration variations shows that the average number of iterations has less encryption and decryption time. Improvements: The hybrid combination of Genetic algorithm and AES-128 can be further modified for images and audio messages also. Keywords: Genetic Algorithm, Iterations, Non-Repetitive Cipher Key, Population Size, Substitution Box

A Novel Image Stream Cipher Based On Dynamic Substitution

Recently, many chaos-based stream cipher algorithms have been developed. Traditional chaos stream cipher is based on XORing a generated secure random number sequence based on chaotic maps (e.g. logistic map, Bernoulli Map, Tent Map etc.) with the original image to get the encrypted image, This type of stream cipher seems to be vulnerable to chosen plaintext attacks. This paper introduces a new stream cipher algorithm based on dynamic substitution box. The new algorithm uses one substitution box (S-box) and a chaotic shuffling process. Each byte in the plain image vector is substituted using a different S-box to get the cipher image vector. This algorithm is designed to be invulnerable to chosen plaintext attacks. In addition, this algorithm is more secured compared to conventional stream cipher.