Multiple S-boxes Research Articles

Design and implementation of dynamic s-boxes based on non-degenerate discrete chaotic systems

In recent years, digital chaotic systems have received considerable attention in the field of secure communications. However, during the digitalization of the system, the original properties of the chaotic system may change, resulting in the degradation of the dynamics. To address this problem, this paper designs a novel simplicial non-degenerate discrete chaotic system based on the inverse hyperbolic tangent function, and selects a three-dimensional discrete system as the object of analysis. Through the research conducted, it is found that the chaotic system exhibits high Lyapunov exponents under certain conditions. Furthermore, the excellent randomness of the system has been further validated by NIST SP800–22 tests. At the same time, this paper also proposes a dynamic S-box construction method based on the chaotic sequence generated from the three-dimensional chaotic mapping. By performing a series of basic operations and permutation treatment, many dynamic S-boxes can be generated. This paper comprehensively analyses the performance of S-boxes from two perspectives: single S-boxes and multiple S-boxes. The analysis covers issues such as bijective property, nonlinearity, strict avalanche criterion, differential approximation probability and bit independence criteria. The results of the performance analysis show that the dynamically generated S-boxes have excellent cryptographic properties, making them suitable for the design and application of cryptographic algorithms.

Reconstructing S-Boxes from Cryptographic Tables with Milp

Reconstructing an S-box from a cryptographic table such as difference distribution table (DDT), linear approximation table (LAT), differential-linear connectivity table (DLCT) or boomerang connectivity table (BCT) is one of the fundamental problems in symmetric-key cryptography. Till now, there are only very few known methods which can reconstruct an S-box from a given table: guess-and-determine algorithms of Boura et al. (DCC 2019) and Tian et al. (DCC 2020), sign determination algorithm of Dunkelman et al. (ToSC 2019) and STP based approach of Lu et al. (DCC 2022). In this paper we consider the reconstruction problem in an even more challenging setup where one needs to reconstruct S-boxes from a partial cryptographic table. We are able to reconstruct S-boxes when only a few number of rows of a cryptographic table is given. This problem has never been studied in the literature. We apply mixed integer linear programming (MILP) as the key tool for solving this problem. Needless to say that we can solve the reconstruction problem when the full table is given and this is the first ever application of MILP tool in solving such fundamental problems. As a further application of our method, we provide the generic MILP models which can search for S-boxes with a given cryptographic property such as differential uniformity, linearity, differential-linear uniformity or boomerang uniformity. Additionally, our method can recover a Boolean function from a given Walsh spectrum or a Boolean function with a given nonlinearity. We also introduce a new heuristic called Optimistic MILP objective that guides the model towards obtaining multiple S-boxes or Boolean functions with the same cryptographic property. We give detailed experimental results for up to 6-bit S-boxes showing the effectiveness of our technique.

An Innovative approach towards image encryption by using novel PRNs and S-boxes Modeling techniques

Efficient multiple pseudo-random number sequences (PRNS) and substitution boxes (S-boxes) are one of the most significant building blocks, which are jointly adopted normally for secure data encryption. Multiple aspects pave the way to handle large-scale multimedia data. However, the computational efforts on multiple constructions may certainly lead to limits the required ciphering through-put. Therefore, reducing the computational cost of multiple patterns such as PRNS and S-boxes is the core requirement for an efficient cryptosystem. For this achievement, we exploited the indexing technique over elliptic curves with small prime fields to introduce a computationally efficient mechanism for both multiple PRNS and multiple S-boxes. In the newly constructed PRNS and S-boxes, we used collectively EC group law and simple algebraic operations to get the security strength as well as low computational cost respectively. Based on statistical results, the proposed S-box mechanism is the most effective method that generates efficient multiple S-boxes on minimum prime fields. Likewise, the PRNS’s simulation results shows that the proposed mechanism is the highly effective model for generating multiple verified pseudo random patterns on small prime fields in a single round. These assessments indicates that the proposed mechanism offers desired key-space, better statistical features of encrypted data and less computational cost.

Android sms and file manager encrypted application using aes-vigenere and aes/ecb/pkcs5/padding a hybrid encryption algorithm

The study, entitled Android SMS and File Manager Encrypted Application Using AES-Vigenere and AES/ECB/PKCS5/Padding a Hybrid Encryption Algorithm, was a proposed solution about Social Engineering and hacking. With the Data Privacy Act of 2012, the study encourages and inspires. The study's goal is to offer users security and safety for their personal information. The purpose of this research is to prevent cyber theft. The theft of financial and/or personal information through the use of a computer/device for fraudulent or other criminal purposes is referred to as cyber theft. For this situation, the study suggested solutions.The research covers the first chapter's Project Context, Purpose and Description, Conceptual Framework, Objectives, Scope, and Limitations. The first chapter offers a general overview of the application. The project background covered the area, challenge, and how the developers came up with the plan, as well as the main point of the research. The objectives were directed at the system's functioning, and the scope and constraints were addressed to determine the study's capability and boundaries. The research also offered the associated literature and study materials synthesized, such as the Changed AES Algorithm Using Multiple S-Boxes, which assists the group in altering and producing a unique and freshly modified algorithm that would improve the security of the application.The research, on the other hand, went into the technical background as well as the hardware and software requirements that the developers employed to improve the program. The research gives information on the system requirements that comprise the versions of software and hardware that the application's proponents utilized to develop it. The design and methodology of our study were also discussed. This includes many schematics depicting the system's flow as well as a constructed prototype. The research demonstrates the concepts and frameworks that the application's proponents utilized to design the application. This chapter contains factual information regarding the actions and techniques taken by the responders in constructing the application. This also includes ways for how the proponents undertake data collection operations.

Android sms and file manager encrypted application using aes-vigenere and aes/ecb/pkcs5/padding a hybrid encryption algorithm


 
 
 The study, entitled Android SMS and File Manager Encrypted Application Using AES-Vigenere and AES/ECB/PKCS5/Padding a Hybrid Encryption Algorithm, was a proposed solution about Social Engineering and hacking. With the Data Privacy Act of 2012, the study encourages and inspires. The study's goal is to offer users security and safety for their personal information. The purpose of this research is to prevent cyber theft. The theft of financial and/or personal information through the use of a computer/device for fraudulent or other criminal purposes is referred to as cyber theft. For this situation, the study suggested solutions.The research covers the first chapter's Project Context, Purpose and Description, Conceptual Framework, Objectives, Scope, and Limitations. The first chapter offers a general overview of the application. The project background covered the area, challenge, and how the developers came up with the plan, as well as the main point of the research. The objectives were directed at the system's functioning, and the scope and constraints were addressed to determine the study's capability and boundaries. The research also offered the associated literature and study materials synthesized, such as the Changed AES Algorithm Using Multiple S-Boxes, which assists the group in altering and producing a unique and freshly modified algorithm that would improve the security of the application.The research, on the other hand, went into the technical background as well as the hardware and software requirements that the developers employed to improve the program. The research gives information on the system requirements that comprise the versions of software and hardware that the application's proponents utilized to develop it. The design and methodology of our study were also discussed. This includes many schematics depicting the system's flow as well as a constructed prototype. The research demonstrates the concepts and frameworks that the application's proponents utilized to design the application. This chapter contains factual information regarding the actions and techniques taken by the responders in constructing the application. This also includes ways for how the proponents undertake data collection operations.
 
 

A novel of substitution-box design using PLL algorithms in magic cube

In most modern symmetric ciphers, substitution boxes are non-linear core components that provide robust security and confusion. The construction of active S-boxes has been hot object among safely experts. The goal is at build a cryptographically active S-box, number of researchers have built an S-Box using RNA, DNA, chaotic systems, etc. In this article, we used new approach to generate multiple S-Boxes based on the Permutation of Last Layer algorithms (PLL) to replacement the place (permutation) of the pieces generated from the Magic Cube and instead of using static S-Boxes, we can generate dynamic S-Boxes to use various S-Boxes in every round to add to confusion. When comparing the proposed algorithm with other searches and tests on it. We found it has achieved a high percentage of success comparable to the S-Box from chaotic and etc. The proposed design passes S-Box test criteria effectively, these tests: invertibility, completeness, avalanche, strict avalanche, and balanced are among S-Box test criteria. The results of the analysis show that the novel S-Box overrun each of these statistical tests, has a good avalanche impact, and thus can protect against a wide range of attacks. Because S-Box and its reverse take but smaller milliseconds to construct it ability be applied in a variety of lightweight applications

A New Image Encryption Algorithm Based on Single S-Box and Dynamic Encryption Step

Chaotic-based S-box image encryption schemes promise the practicability solution in securing digital images. However, the high-dimensional continuous chaotic has increased the algorithm’s complexity. Recent alternatives that focused on double or multiple S-boxes approaches, on the other hand, have been proven vulnerable to differential attacks. This paper presents an efficient and secure chaotic-based S-box image encryption scheme. Firstly, a single S-box with a size of 10×26 was constructed by using a low-dimensional chaotic system. Without a complex mathematical operation, the constructed single S-box has obvious efficiency advantages and achieved a higher image entropy rate than recent double or multiple S-boxes. Secondly, a new dynamic encryption step method is proposed to solve the high correlation and deterministic problems in multiple S-box encryptions. Under the control of the dynamic encryption step algorithm, it effectively destroys the correlation between the source image’s pixels. The experimental results and security analysis show that the proposed scheme enjoys higher security and is more efficient to secure digital images in real-world applications.

An Efficient Audio Encryption Scheme Based on Finite Fields

Finite fields are well-studied algebraic structures with enormous efficient properties which have applications in the fields of cryptology and coding theory. In this study, we proposed a lossless binary Galois field extension-based efficient algorithm for digital audio encryption. The proposed architecture hired a special type of curve in the diffusion module which depends on efficient elliptic curve arithmetic operations. So, it generates good quality pseudo-random numbers (PRN) and with slight computational efforts, it produces optimum diffusion in the encrypted audio files. For the confusion module, a novel construction mechanism of block cipher has been employed which includes prominent arithmetic operations of binary Galois field inversion and multiplication operations. The suggested scheme generates multiple substitution boxes (S-boxes) by using a higher-order Galois field. Thus, the replacement with multiple S-boxes generates effective perplexity in the data and provides additional security to the ciphered audio. The investigational outcomes through different analyses and time complexity demonstrated the ability of the technique to counter various attacks. Furthermore, as a consequence of a rapid and simple application of the binary finite field in hardware and software, the proposed scheme is more appropriate to be applied for data security.

Block cipher’s nonlinear component design by elliptic curves: an image encryption application

Due to less computational effort with strong security, Elliptic curve based cryptographic architectures are more reliable as compared to the existing cryptographic methods. In this manuscript, we have introduced an efficient cryptosystem based on elliptic curves for digital image encryption. The designed scheme is consisting of three steps. Initially, the system uses the special type of the isomorphic elliptic curves over a prime field and scrambles the pixel position of the plain image. Consequently, it disperses the intra-correlation among the pixels of the original image, and capable the scheme to be secure against statistical attacks. In the next step, the scheme generates multiple S-boxes with good cryptographic features by using isomorphic elliptic curves. The generated S-boxes are then used to substitute the scrambled data that produce optimum confusion in the ciphered data. Eventually, the encryption procedure generates pseudo-random numbers (PRNs) through the arithmetic operation of the elliptic curves instead of elliptic curve group law; the operation used in the scheme creates high randomness as a result our proposed scheme shows high security against classical attacks. The simulation results and performance analysis divulge that the proposed scheme has excellent encryption performance with less computational effort, which indicates that the scheme has effective potential in real-time image encryption application.

Image Encryption Using Dynamic S-Box Substitution in the Wavelet Domain

A number of image encryption techniques have been proposed in recent years. These techniques use either spatial or transform domain image processing. A major challenge when designing an image encryption scheme is to conceal the pixel of the input image, especially when the image has a low texture region. Another problem is the encryption computational time. In this paper, these two issues are addressed. As the use of a single substitution box (S-box) to encrypt digital images does not work well for greater as well as a lower number of gray levels. To solve this problem, a new substitution technique using multiple S-boxes with dynamic substitution is proposed. In the second part of this paper, the proposed discrete wavelet transform based scheme is employed to reduce the encryption computational time. A number of parameters like correlation, entropy, energy, contrast, homogeneity, MSE and PSNR are used to analyze the quality of cipher images.

Binary Galois field extensions dependent multimedia data security scheme

Finite fields are widely used in modern cryptographic architecture. The prominent finite field based symmetric and asymmetric cryptosystems are (ECC) elliptic curve cryptography, RSA, (AES) advanced encryption standard and pairing-based cryptography. The arithmetic operations of a finite field performed efficiently, that meet the design space constraints and execution speed. These aims resolve tremendous challenges, which required interdisciplinary efforts to render the best algorithms, implementations, architectures, and design practices. This study proposes convenient finite field arithmetic based symmetric key cryptosystem for multimedia data security. The scheme is comprised of diffusion and confusion. To execute the diffusion phase the random numbers generation is essential in utilizing the multiplication and inversion operations over the binary Galois field extensions. The main objective of using these operations is to establish substantial randomness with less computational exertions. In addition, a block cipher construction mechanism has been deployed for the confusion phase of the algorithm which generates multiple S-boxes with fewer rounds as compared to the customary block ciphers. Therefore, efficient creation of confusion in multimedia data and hence more security is attained. The experimental results and the time complexity manifest the efficiency of the scheme against various attacks. Also, as a result of a fast and simple implementation of the binary finite field in hardware and software, the proposed cryptosystem is more convenient to implement as compared to the prevailing schemes.

Dynamic substitution based encryption algorithm for highly correlated data

In this paper, single and multiple S-box encryption issues are discussed and a new algorithm is then proposed to solve those issues. As the single S-box encryption completely fails to encrypt the plain image because a single S-box replaces the pixels of the same region with a unique symbol. To break this type of correlation in the image, chaos has been extensively used. The multiple S-boxes techniques are becoming more popular over the last decade to overcome the drawbacks of single S-box encryption. However, replacing single S-box with multiple S-boxes is somehow good for the encryption of those images which contain more number gray levels i.e 256 gray levels, but it cannot properly conceal the pixels of an image having less number of gray levels i.e binary or plain white images which contain only one gray level. To solve these issues, a dynamic substitution based encryption algorithm (DSA) is proposed, which is specially designed for the highly correlated images. Security analysis and evaluation show that the proposed algorithm can accomplish to conceal the highly correlated data.

An approach of refining RC4 with performance analysis on new variants

Many years of research on the RC4 stream cipher proves it to be strong enough, but there are claims that its swap function is responsible for essential biases in the output. There are suggestions to discard some initial bytes from the key-stream, to get rid of this, before the actual encryption starts, though no optimum value has been defined. In this paper, by analysing different variants of RC4, the authors have attempted to find out whether this cipher becomes more secure by discarding initial bytes and, if so, what is its optimum limit. Also, multiple S-boxes generated by different logics and a unique key-mixing procedure have been implemented, which made k RC4 more robust.

Efficient image encryption scheme with synchronous substitution and diffusion based on double S-boxes**Project supported by the Natural Science Foundation of Shaanxi Province, China (Grant No. 2014JM8322).

Single or multiple S-boxes are widely used in image encryption schemes, and in many image encryption schemes the asynchronous encryption structure is utilized, which separates the processes of substitution and diffusion. In this paper, we analyze the defects of this structure based on the example of an article and crack it using a simpler method. To address the defects of the asynchronous encryption structure, a novel encryption scheme is proposed, in which the structure of synchronous substitution and diffusion based on double S-boxes is utilized, so the processes of substitution and diffusion are combined together and the attackers cannot crack the cryptosystem by any of the processes. The simulation results and security analysis show that the proposed encryption scheme is safer and more efficient to expediently use in the real-time system.

High Order Masking of Look-up Tables with Common Shares

Masking is an effective countermeasure against side-channel attacks. In this paper, we improve the efficiency of the high-order masking of look-up tables countermeasure introduced at Eurocrypt 2014, based on a combination of three techniques, and still with a proof of security in the Ishai-Sahai-Wagner (ISW) probing model. The first technique consists in proving security under the stronger t-SNI definition, which enables to use n = t+1 shares instead of n = 2t+1 against t-th order attacks. The second technique consists in progressively incrementing the number of shares within the countermeasure, from a single share to n, thereby reducing the complexity of the countermeasure. The third technique consists in adapting the common shares approach introduced by Coron et al. at CHES 2016, so that half of a randomized look-up table can be pre-computed for multiple SBoxes. We show that our techniques perform well in practice. In theory, the combination of the three techniques should lead to a factor 10.7 improvement in efficiency, for a large number of shares. For a practical implementation with a reasonable number of shares, we get a 4.8 speed-up factor for AES.

A Random PRESENT Encryption Algorithm Based on Dynamic S-box

S-box mainly plays the role of confusion in the encryption process as an important component. For the new encryption algorithm PRESENT proposed in 2007, S-box impacts on the security of the encryption algorithm directly. This paper briefly describes the process of PRESENT algorithm and proposes an improved S-box to solve the problem that the original PRESENT S-box has anti-fixed point. Then a random PRESENT encryption algorithm based on dynamic S-box is proposed. The dynamic multiple S-boxes technology is used to implement random PRESENT algorithm, to enhance the security of the cryptographic algorithm. Finally, the security analysis is done, and it suggests that dynamic S-box has a superior ability to resist differential attack and linear attack. By comparison to the diffusion rate of original PRESENT S-box, our dynamic S-box has better avalanche effect. With the rapid development of the Internet of Things, the radio frequency identification (RFID), wireless sensor network (WSN), and other new technologies go deep into all aspects of people's work and life. However, RFID and WSN are based on wireless network to transfer information. The transmission of information is not difficult to be obtained, interfered, and even destroyed by the attackers. So information security technology is widely used in protecting networks to enhance the safety of secret information. And the traditional symmetric encryption algorithm is often restricted by hardware, which cannot achieve good effects under the condition of limited hardware and power consumption. Therefore, lightweight cipher algorithm such as PRESENT(1) and LED(2) has gradually become the realistic choice to ensure the information security of Internet of Things. The lightweight block encryption algorithm PRESENT (1), put forward by Bogdanov in 2007, is carefully designed with area and power constraints uppermost in limited conditions. So the PRESENT algorithm still has high security in the application of limited space and power consumption, such as sensor network node. However, the permutation transformation of PRESENT algorithm is different with the column confusion of AES. It uses bit as the permutation function input unit while AES uses byte for permutation. The permutation layer of PRESENT encryption algorithm is a perfectly symmetrical structure and easy implemented. Because the structure of this kind of design has poor diffusibility, the PRESENT algorithm diffusively quality mainly depends on the diffusion properties of S-box. So S-box, as a nonlinear component in lightweight block encryption algorithm, affects the strength of the whole structure of the cipher. To strengthen DES by using existing hardware, an improved method of DES which uses the S-box related to a key is put forward in paper (4), and the researcher has demonstrated the safety of the improved method. Meanwhile, a new key related

S-Boxes Based on Affine Mapping and Orbit of Power Function

The demand of data security against computational attacks such as algebraic, differential, linear and interpolation attacks has been increased as a result of rapid advancement in the field of computation. It is, therefore, necessary to develop such cryptosystems which can resist current cryptanalysis and more computational attacks in future. In this paper, we present a multiple S-boxes scheme based on affine mapping and orbit of the power function used in Advanced Encryption Standard (AES). The proposed technique results in 256 different S-boxes named as orbital S-boxes. Rigorous tests and comparisons are performed to analyse the cryptographic strength of each of the orbital S-boxes. Furthermore, gray scale images are encrypted by using multiple orbital S-boxes. Results and simulations show that the encryption strength of the orbital S-boxes against computational attacks is better than that of the existing S-boxes.

PERFORMANCE EFFICIENCY OF MODIFIED AES ALGORITHM USING MULTIPLE S-BOXES

In our previous paper, we modified the Advance Encryption System (AES) algorithm by proposing to use multiple substitution boxes (S-Boxes). While many studies have been conducted specifically on modifying the S-box, these studies were made to replace the Rijndael S-box in the AES cipher. Our version of the AES algorithm used two substitution boxes where the first S-box is the Rijndael S-box and was used as is. The second S-box was constructed by performing an XOR operation and affine transformation. Furthermore, the second S-Box replaced the MixColumns operation within the internal rounds in the cipher. This paper aims to determine the performance efficiency of the modified AES algorithm using multiple S-Boxes. Based on the result of the experiments, it was found out that the modified AES algorithm using multiple S-Boxes has an achieved execution time performance efficiency of 22.986% for encryption and 109.76% for decryption processes. However, when tested using the avalanche effect, the changes in the output bits were below the minimum expected rate at 24.219% and 19.531% respectively.

An efficient chaotic image encryption based on alternate circular S-boxes

A novel and efficient image encryption algorithm based on chaos and multiple S-boxes is proposed in this paper, in which a set of S-boxes is initially constructed using a chaotic system, and each of the S-boxes is considered as a circular sequence with a head pointer. For each image pixel, an S-box is chosen from the set of S-boxes and used to substitute for the plain pixel to get a cipher pixel, and then the chosen S-box is updated by moving its head pointer forward according to the cipher pixel and a random number. In order to increase the plaintext sensitivity of encryption, the substitution processes are performed in forward direction and backward direction, respectively. This scheme not only offers the high security by employing two directional substitutions and using the different S-boxes for each pixel but also achieves high encryption speed by constructing only a few S-boxes and updating the S-box dynamically and easily. The performance of the proposed algorithm is evaluated using a variety of analysis. Experimental results show that the proposed image encryption algorithm is secure and efficient.

Mathematical analysis and simulation of multiple keys and S-Boxes in a multinode network for secure transmission

The requirement of data security is an important parameter for all organizations for their survival in the world. Cryptography is the best method to avoid unauthorized access to data. It involves an encryption algorithm and the keys that are being used by the users. Multiple keys provide a more secure cryptographic model with a minimum number of overheads. There are various factors that affect the security pattern such as the number of keys and their length, encryption algorithm, latency, key shifting time, and users. In this paper, a new approach is proposed for generating keys from the available data. The analysis of various times, such as encryption, decryption, key setup, processing, and key shifting times, has been done. The model takes minimum time to replace the faulty keys with the fresh keys. In this paper, we consider all the above-mentioned factors and suggest an optimized way of using them.