Strict Avalanche Criterion Research Articles

Region of interest-based medical image encryption technique based on chaotic S-boxes

Block cipher has been one of the most reliable options by which data security is achieved. The strength of block cipher against various attacks is purely dependent on its confusion property, which is gained through the S-Boxes. In recent years, S-Boxes based on chaotic maps have become popular due to their favorable characteristics for cryptography. However, vulnerabilities have been discovered in these constructions, leading to concerns about their reliability. In this research, we first generate dynamic S-Boxes, and then based on the newly generated S-Boxes, a ROI-based medical image encryption scheme is proposed to address the challenges posed by the large size of DICOM images. Rather than encrypting the entire DICOM image, proposed encryption scheme only encrypts the ROI part where the relevant information is present, while leaving the black background unencrypted. This approach reduces the size of the encrypted data and improves the efficiency of the encryption process, while maintaining the privacy and confidentiality of sensitive medical data. The proposed ROI-based medical image encryption scheme is evaluated using standard performance metrics, including encryption speed, image quality tests, correlation-coefficient analysis, randomness of encrypted images, key sensitivity analysis, encryption sensitivity analysis, decryption sensitivity analysis, and resistance against common attacks such as differential and linear attacks. The proposed dynamic S-Box construction technique is evaluated using standard S-Box criteria, which include nonlinearity score, bit independence criterion, strict avalanche criteria, linear approximation probability, and differential approximation probability. Results demonstrate that the proposed technique gains high levels of encryption efficiency and security, making it a fast solution for secure medical image transmission in real-world applications.

Design and optimization of nonlinear component of block cipher: Applications to multimedia security

Nowadays, various image encryption schemes based on chaotic systems have been developed, each of them has its own limitations and strength in terms of security and computational speed. The proposed image encryption scheme utilizes 2-D maps without disturbing their mathematical structure, characterized by topological features such as chaotic behavior and fractal properties, namely the Zaslavasky, Bakers, and Henon Maps. This approach utilizes both confusion and diffusion stages to achieve high levels of security against various attacks. The confusion stage utilizes chaotic values to muddle the rows and columns of the image, reducing the correlations between neighboring pixels, while the diffusion step achieves the avalanche effect with 2D Bakers map and Henon map. The proposed image encryption scheme is analyzed thoroughly to evaluate its security and performance. To evaluate the security and computational efficiency of the proposed image encryption method, various analysis such as correlation, contrast, entropy, energy, homogeneity, and performance analyses are conducted. Moreover, the three proposed S-boxes are also tested to evaluate their effectiveness using cryptographic analysis tests such as nonlinearity, strict Avalanche criterion, differential probability, linear probability, and bit independence criterion, which we also utilized in our proposed image encryption scheme.

Modeling-Attack-Resistant Strong PUF Exploiting Stagewise Obfuscated Interconnections With Improved Reliability

This article presents an obfuscated-interconnection physical unclonable function (OIPUF) to resist modeling attacks. By introducing nonlinear operations through exploiting the random interconnections of delay stages, the proposed OIPUF can theoretically improve the PUF security while consuming the same hardware resources as the conventional XOR Arbiter PUF (XOR APUF). We further propose the metastability-detection (MD) arbiter to effectively improve the PUF reliability. Implemented on Xilinx Artix-7 FPGA, both the proposed (64,4)-and (64,8)-OIPUF demonstrate a good reliability and uniformity, with the proposed (64,8)-OIPUF showing a better uniqueness and strict avalanche criterion (SAC) performance. Measurement results also show that the proposed MD arbiter can reduce the bit error rate (BER) of the (64,4)-and (64,8)-OIPUF by.68 and.48 at up to 100.C, respectively. Evaluated using the Logistic Regression (LR), Artificial Neural Network (ANN), and Covariance Matrix Adaptation-Evolution Strategy (CMAES) machine learning (ML) algorithms, the proposed (64,4)-and (64,8)-OIPUF can achieve a worst case prediction accuracy of 61.47% and 50.59% with up to 10M CRPs as training set, respectively, demonstrating a significant improvement over similar prior arts.

Hybrid multi-criteria decision-making technique for the selection of best cryptographic multivalued Boolean function

Robustness of modern information confidentiality algorithm depends on its individual components. Modern block ciphers highly depend on two components namely confusion and diffusion. These two main characteristics in any modern cipher are achieved by substitution and permutation boxes. In this article, a decision-making algorithm is utilized for the selection of optimum substitution box (S-box), which plays a significant role in the field of information confidentiality. For this purpose, an interval-based Pythagorean fuzzy technique for order of preference by similarity to the ideal solution (IVPF–TOPSIS) method is introduced to get the desired nonlinear confusion component of block cipher namely S-box. In this manner, we performed cryptographic analyses of standard S-boxes namely nonlinearity (NL), strict avalanche criterion (SAC), bit-independent criterion (BIC), absolute indicator (ABI), the sum of square and absolute indicator (SSAI), algebraic degree (AD), algebraic immunity (AI), transparency order (TO), composite algebraic immunity (CAI), robustness (RB), signal to noise ratio (SNR), confusion coefficient of variance (CCV). With these cryptographic characteristics, we have used interval-valued based Pythagorean fuzzy TOPSIS multi-criteria decision-making technique to classify standard S-boxes suitable for construction of modern block ciphers.

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.

Chaos and Cellular Automata-Based Substitution Box and Its Application in Cryptography

Substitution boxes are the key factor in symmetric-key cryptosystems that determines their ability to resist various cryptanalytic attacks. Creating strong substitution boxes that have multiple strong cryptographic properties at the same time is a challenging task for cryptographers. A significant amount of research has been conducted on S-boxes in the past few decades, but the resulting S-boxes have been found to be vulnerable to various cyberattacks. This paper proposes a new method for creating robust S-boxes that exhibit superior performance and possess high scores in multiple cryptographic properties. The hybrid S-box method presented in this paper is based on Chua’s circuit chaotic map, two-dimensional cellular automata, and an algebraic permutation group structure. The proposed 16×16 S-box has an excellent performance in terms of security parameters, including a minimum nonlinearity of 102, the absence of fixed points, the satisfaction of bit independence and strict avalanche criteria, a low differential uniformity of 5, a low linear approximation probability of 0.0603, and an auto-correlation function of 28. The analysis of the performance comparison indicates that the proposed S-box outperforms other state-of-the-art S-box techniques in several aspects. It possesses better attributes, such as a higher degree of inherent security and resilience, which make it more secure and less vulnerable to potential attacks.

A Chaotic System and Count Tracking Mechanism-based Dynamic S-Box and Secret Key Generation

In cryptography, Block ciphers use S-Boxes to perform substitution and permutation operations on a data block. S-Boxes provide non-linearity and confusion of bits to the cryptographic algorithms. In addition, secret keys are critical security aspects for encrypting and decrypting messages. The uncertainty and randomness of the secret key and S-boxes used in the algorithm determine the extent of security against any cryptanalysis attack. This paper proposes a new mechanism to dynamically generate a secret key and S-Box each time while sending and receiving the message. These dynamically generated S-Boxes and keys depend on mutually decided security parameters and message transfer history. Furthermore, a new counter-based mechanism is introduced in this paper. These enhancement techniques are applied to the serpent cipher algorithm, and a data transfer simulation is performed to validate the efficacy of the proposed method. We observe that the dynamically generated S-box follows the strict avalanche criteria. We further validate that the encrypted message shows higher sensitivity to the S-box and the secret key in enhanced serpent cipher than the original version. However, to validate our proposed method, we test and analyze the improvements in the Serpent Cipher Algorithm.

An Efficient Substitution Box design with a chaotic logistic map and Linear Congruential Generator for secure communication in Smart cities

The study provides a unique method for creating an efficient substitution box (S-box) for advanced encryption standards using a Chaotic Logistic Map (CLM) and a Linear Congruential Generator (LCG) (AES) for secure communications in a smart city. The Pseudo-Random Number Generator (PRNG), which is further examined, is constructed using an extensive search of reasonable possibilities for the initial seed and set parameters. Using statistical testing, the performance analysis of the new S-box is assessed. Additionally, the resilience of differential, as well as linear cryptanalysis, is shown. It is derived using other features, including nonlinearity, the Bit Independence Criterion (BIC), and the Strict Avalanche Criterion (SAC). The suggested S-box has good potential and is usable for symmetric key cryptography, according to the features of the new S-cryptographic box.

A novel encryption algorithm using multiple semifield S-boxes based on permutation of symmetric group

There is a need of secure and robust encryption algorithm that can be implemented on each and diverse software and hardware platforms. In this paper, we investigate semifield substitution boxes using permutation of symmetric group on a set of size 8 S_8 and establish an effective procedure for generating S_8 semifield substitution boxes having same algebraic properties. Further, the strength analysis of the generated substitution boxes is carried out using the well-known standards, namely bijectivity, non-linearity, strict avalanche criterion, bit independence criterion, XOR table and differential invariant. As application, an encryption algorithm is proposed that can be employed to strengthen any kind of secure communication. The presented algorithm is mainly based on the Shannon idea of substitution–permutation network where the process of substitution is performed by the proposed S_8 semifield substitution boxes and permutation operation is performed by the binary cyclic shift of substitution box transformed data. In addition, the proposed encryption algorithm utilizes two different chaotic maps. To ensure the appropriate utilization of these chaotic maps, we carry out in-depth analyses of their behavior in the context of secure communication and apply the pseudo-random sequences of chaotic maps in the proposed image encryption algorithm accordingly.

A security model to protect the isolation of medical data in the cloud using hybrid cryptography

A cloud computing platform delivers a cost-efficient path for cloud users to store and access data privately over remote storage via an Internet connection. Medical data is stored in the cloud since it is scalable, secure, reliable, provides ubiquitous access, and is highly available. It is required to be isolated in terms of physical, network, and operational for protecting data from internal threats or external cyber-attacks. It can be achievable through hybrid cryptography in which symmetric, as well as asymmetric cryptosystem, is being utilized. To assure the confidentiality and integrity of medical data, an improved Robust S-box-based Advanced Encryption Standard (IRS-AES) is proposed with Runge-Kutta Optimization (RKO) algorithm. RKO generates an enhanced and secured RS-box through the computation of the Mackey-Glass equation. Initially, the medical data are compressed using Improved Huffman Coding (IHC). The Deoxyribonucleic Acid (DNA)-based Modified Elliptic Curve Cryptography (MECC) algorithm is introduced for key generation, and the best key is selected with Bald Eagle Search optimization (BES) algorithm. Finally, the medical data are encrypted IRS-AES algorithm and stored in the cloud. The proposed RS-box security strength is evaluated using non-linearity, Strict Avalanche Criterion (SAC), Differential Probability (DP), Bit Independence Criterion (BIC), and Linear Probability (LP) parameters. The efficiency of the proposed algorithm is evaluated with image, audio, and video dataset. The evaluation metrics such as communication overhead, file upload time, computational cost, Mean Square Error (MSE), encryption and decryption time, Peak Signal-to-Noise Ratio (PSNR), key generation time, and Signal-to-Noise Ratio (SNR) are used for validating the proposed approach. The performance of the proposed approach is enhanced with the communication overhead of 11.51 for the image dataset. MSE and PSNR obtained are 16.2 and 8.465 for an audio dataset, 75.21 and 3.5 for the video dataset.

Classification of Nonlinear Confusion Component Using Hybrid Multi-Criteria Decision Making

In today’s digital world, the most inevitable challenge is the protection of digital information. Due to the weak confidentiality preserving techniques, the existing world is facing several digital information breaches. To make our digital data indecipherable to the unauthorized person, a technique for finding a cryptographically strong Substitution box (S-box) have presented. An S-box with sound cryptographic assets such as nonlinearity (NL), strict avalanche criterion (SAC), bit independence criteria (BIC), bit independence criteria of nonlinearity (BIC-NL), Bit independence criteria of Strict avalanche criteria (BIC-SAC), and Input/output XOR is considered as the robust S-box. The Decision-Making Trial and Evaluation Laboratory (DEMATEL) approach of multi-criteria decision making (MCDM) is proposed for finding the interrelation among cryptographic properties. A combination of two MCDM methods namely Entropy and multi-objective optimization based on ratio analysis (MOORA) is applied for the best S-box selection. A robust substitution box is selected for secure communications in cryptography by using the combination of DEMETAL selection criteria, entropy weight assigning, and MOORA ranking scheme. The combination of these three methods provides a fast selection procedure for the secure confusion component. The offered selection method can also be utilized for the choice of the best cryptosystem with highly secure properties and resistive against all possible linear and differential attacks in the cryptanalysis.

Construction and Optimization of Dynamic S-Boxes Based on Gaussian Distribution

Block ciphers are widely used for securing data and are known for their resistance to various types of attacks. The strength of a block cipher against these attacks often depends on the S-boxes used in the cipher. There are many chaotic map-based techniques in the literature for constructing the dynamic S-Boxes. While chaos-based approaches have certain attractive properties for this purpose, they also have some inherent weaknesses, including finite precision effect, dynamical degradation of chaotic systems, non-uniform distribution, discontinuity in chaotic sequences. These weaknesses can limit the effectiveness of chaotic map-based substitution boxes. In this paper, we propose an innovative approach for constructing dynamic S-boxes using Gaussian distribution-based pseudo-random sequences. The proposed technique overcomes the weaknesses of existing chaos-based S-box techniques by leveraging the strength of pseudo-randomness sequences. However, one of the main drawbacks of using Gaussian distribution-based pseudo-random sequences is the low nonlinearity of the resulting S-boxes. To address this limitation, we introduce the use of genetic algorithms (GA) to optimize the nonlinearity of Gaussian distribution-based S-boxes while preserving a high level of randomness. The proposed technique is evaluated using standard S-box performance criteria, including nonlinearity, bit independence criterion (BIC), linear approximation probability (LP), strict avalanche criterion (SAC), and differential approximation probability (DP). Results demonstrate that the proposed technique achieves a maximum nonlinearity of 112, which is comparable to the ASE algorithm.

Novel Scheme for Robust Confusion Component Selection Based on Pythagorean Fuzzy Set

The substitution box, often known as an S-box, is a nonlinear component that is a part of several block ciphers. Its purpose is to protect cryptographic algorithms from a variety of cryptanalytic assaults. A MultiCriteria Decision Making (MCDM) problem has a complex selection procedure because of having many options and criteria to choose from. Because of this, statistical methods are necessary to assess the performance score of each S-box and decide which option is the best one available based on this score. Using the Pythagorean Fuzzy-based Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method, the major objective of this investigation is to select the optimal S-box to be implemented from a pool of twelve key choices. With the help of the Pythagorean fuzzy set (PFS), the purpose of this article is to evaluate whether this nonlinear component is suitable for use in a variety of encryption applications. In this article, we have considered various characteristics of S-boxes, including nonlinearity, algebraic degree, strict avalanche criterion (SAC), absolute indicator, bit independent criterion (BIC), sum of square indicator, algebraic immunity, transparency order, robustness to differential cryptanalysis, composite algebraic immunity, signal to noise ratio-differential power attack (SNR-DPA), and confusion coefficient variance on some standard S-boxes that are Advanced Encryption Following this, the findings of the investigation are changed into Pythagorean fuzzy numbers in the shape of a matrix. This matrix is then subjected to an analysis using the TOPSIS method, which is dependent on the Pythagorean fuzzy set, to rank the most suitable S-box for use in encryption applications.

STUDY OF THE CRYPTOGRAPHIC STRENGTH OF THE S-BOX OBTAINED ON THE BASIS OF EXPONENTIATION MODULO

This article presents one of the main transformations of symmetric block ciphers used to protect confidential information, a new method for obtaining a non-linear S block, and an analysis of the results obtained. The S-box obtained by this method can be used as a non-linear transformation in block cipher algorithms to protect confidential data transmitted over an open channel. In most well-known works in the field of analysis and synthesis of modern block symmetric ciphers, S-box is used as a mathematical apparatus for cryptographic Boolean functions. In this case, each S-box is represented by a set of composite Boolean functions whose properties characterize the efficiency of the nonlinear substitution node. Substitution nodes for modern symmetric primitives, including key unfolding functions, are usually implemented as replacement tables. Considering that in most modern block symmetric ciphers for introducing round keys, the encryption algorithm uses a linear operation (bitwise addition modulo 2), S-blocks are the only elements responsible for the cryptographic stability of block encryption algorithms. The required number of rounds of block symmetric ciphers is selected taking into account the results of the cryptographic analysis performed, provided that the properties of S-boxes are specified. As the main criteria and performance indicators, the balance and nonlinearity of composite Boolean functions are used; strict avalanche criterion (SAC), propagation criterion; algebraic degree; the value of the autocorrelation function. In this article, a study was made of the nonlinearity and strict avalanche criterion (SAC) of the S-box used in the block symmetric encryption algorithm. The results of the study were compared with the S-boxes of modern cryptographic algorithms and showed good results.

A New Design of Substitution Box with Ideal Strict Avalanche Criterion

The use of S-boxes (substitution boxes) to provide nonlinear properties is known to be a common way to design a block cipher. These nonlinear properties are necessary to ensure the security of a block cipher. This manuscript proposes a design construction of a new S-box using affine transformation via cellular automata as a permutation matrix. We incorporate this cellular-automaton permutation matrix into the AES S box structure and test various irreducible polynomials. Nonlinearity, bijection, bit independence criterion, strict avalanche effect, linear approximation probability, and differential uniformity are the standard performance requirements used to evaluate the S-boxes that arise. Using this method, we are able to determine an irreducible polynomial that enables the construction of a new S-box design that can achieve an ideal strict avalanche criterion (SAC), which will subsequently provide efficiency in the design of block ciphers.

Enumerating Discrete Resonant Rossby/Drift Wave Triads and Their Application in Information Security

We propose a new parametrization of the resonant Rossby/drift wave triads to develop an algorithm to enumerate all resonant triads in a given grid of wavenumbers. To arrive at such a parametrization, we have employed tools from arithmetic/algebraic geometry to project resonant triads on a certain class of conics. Further, we extend the newly developed algorithm for the enumeration of quasi-resonant triads and experimentally show that the said algorithm is robust to design the network of quasi-resonances. From the experimental results, we observed that the new algorithm enumerates all triads in low computation time when compared with the existing methods. Finally, we apply this work to information security by constructing a total order on the enumerated resonant triads to design a substitution box (S-box) generator. Via extensive analyses over several indicators (nonlinearity, algebraic complexity, linear and differential approximation probabilities, strict avalanche criteria, and bit independence criterion) we show that the newly developed S-box outperforms the S-boxes constructed by most of the existing schemes.

A strong construction of S-box using Mandelbrot set an image encryption scheme.

The substitution box (S-box) plays a vital role in creating confusion during the encryption process of digital data. The quality of encryption schemes depends upon the S-box. There have been several attempts to enhance the quality of the S-box by using fractal chaotic mechanisms. However, there is still weakness in the robustness against cryptanalysis of fractal-based S-boxes. Due to their chaotic behavior, fractals are frequently employed to achieve randomness by confusion and diffusion process. A complex number-based S-box and a chaotic map diffusion are proposed to achieve high nonlinearity and low correlation. This study proposed a Mandelbrot set S-box construction based on the complex number and Chen chaotic map for resisting cryptanalytic attacks by creating diffusion in our proposed algorithm. The cryptosystem was built on the idea of substitution permutation networks (SPN). The complex nature of the proposed S-box makes it more random than other chaotic maps. The robustness of the proposed system was analyzed by different analysis properties of the S-box, such as nonlinearity, strict avalanche criterion, Bit independent criterion, and differential and linear probability. Moreover, to check the strength of the proposed S-box against differential and brute force attacks, we performed image encryption with the proposed S-box. The security analysis was performed, including statistical attack analysis and NIST analysis. The analysis results show that the proposed system achieves high-security standards than existing schemes.

New Key-Dependent S-Box Generation Algorithm on AES

Aims: Cryptography means 'hidden secrets'. The primary purpose of cryptography is to protect networks and data over a wireless communication channel. The cryptographic approach secures the data of a network from any internal or external attacks. Background: There are several kinds of cryptographic techniques, such as Data Encryption Standard (DES), RSA (Rivest- Shamir- Adleman), Advanced Encryption Standard (AES), Blowfish, Twofish, etc. Out of these algorithms, AES shows wide acceptance for its superiority in providing confidentiality to secret information. Another cause for extensive acceptance is that AES is simple, convenient to implement, has a low charge, and higher security. Several changes have been proposed to modify AES by cryptographers and researchers all around the world. Objective: This research paper offers a new key-dependent s-box generation algorithm for AES. Methods: A list of irreducible polynomials of degree 8 is used to generate the s-box depending on the secret key to provide more invulnerable ciphertext in comparison to standard AES. This design of this proposed model is easy and convenient to implement than different dynamic s-box technology algorithms. Results : The metrics chosen for overall performance evaluation are Frequency Distribution, Chi-square Test, Avalanche Effect, and Strict Avalanche Criterion. Conclusion: The proposed algorithm satisfies the desired property of these metrics and provides better security in contrast to standard AES.

SAAC – Statistical absolute avalanche criterion test for analysis of cryptosystems

Cryptosystems using binary radix (bit) arrays must first meet the strict avalanche criterion, which prevents correlation between input and output values in order to resist differential attacks. For this criterion, which is also called confusion/diffusion and butterfly-effect in the common literature, it is expected that two inputs with only one-bit difference from each other will cause half the total number of bits to differ in the output bits. While the literature includes the difference of at least half of the output bits, it does not include that changing all the bits will cause the binary complement and thus another undesirable result. The Statistical Absolute Avalanche Criterion (SAAC) test proposed in this study allows the statistical determination of a lower limit and the establishment of hypotheses. The SAAC test is a tool that can be easily used in the analysis of cryptosystems, especially encryption methods and message hash functions.

MODIFICATION ADVANCED ENCRYPTION STANDARD (AES) ALGORITHM WITH PERFECT STRICT AVALANCHE CRITERION S-BOX

The Advanced Encryption Standard or better known as the AES Algorithm is a standard algorithm and has been widely used as an application of cryptography. Currently, a lot of research is developing about attacks on the AES algorithm. Therefore, there have been many studies related to modifications to the AES algorithm with the aim of increasing the security of the algorithm and to produce alternatives to encryption algorithms that can be used to secure data. In this study, modifications were made to the AES algorithm by replacing the S-box using the perfect SAC S-box in the SubBytes process. The Perfect SAC S-box has an exact SAC average value of 0.5. The S-box that will be used must have good security strength, therefore the perfect SAC S-box is tested, namely the AC, SAC, BIC, XOR Table Distribution, and LAT Distribution tests. Based on the results of the study, it was found that the perfect SAC S-box had almost the same S-box test results as the AES S-box. Furthermore, after the perfect SAC S-box is applied to the AES algorithm, it is analyzed how the effect of these modifications on the AES algorithm uses randomness testing for the block cipher algorithm, namely the strict avalanche criterion (SAC) test. The results of the AES test with perfect SAC S-box can meet the SAC test since the second round with better results than the original AES algorithm with SAC values of 0.5003 and 0.5019.