In block ciphers,the nonlinear components,also known as sub-stitution boxes(S-boxes),are used with the purpose of inducing confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the ...In block ciphers,the nonlinear components,also known as sub-stitution boxes(S-boxes),are used with the purpose of inducing confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Gaussian integers(GI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.But the prime field dependent on the Elliptic curve(EC)provides one S-box at a time by fixing three parameters a,b,and p.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.展开更多
In block ciphers,the nonlinear components,also known as substitution boxes(S-boxes),are used with the purpose to induce confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the poi...In block ciphers,the nonlinear components,also known as substitution boxes(S-boxes),are used with the purpose to induce confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves,chaotic maps,and Gaussian integers has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Eisenstein integers(EI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.However,in the same way,by taking three fixed parameters only one S-box is obtained through a prime field-dependent Elliptic curve(EC),chaotic maps,and Gaussian integers.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.展开更多
IoT devices have been widely used with the advent of 5G.These devices contain a large amount of private data during transmission.It is primely important for ensuring their security.Therefore,we proposed a lightweight ...IoT devices have been widely used with the advent of 5G.These devices contain a large amount of private data during transmission.It is primely important for ensuring their security.Therefore,we proposed a lightweight block cipher based on dynamic S-box named DBST.It is introduced for devices with limited hardware resources and high throughput requirements.DBST is a 128-bit block cipher supporting 64-bit key,which is based on a new generalized Feistel variant structure.It retains the consistency and significantly boosts the diffusion of the traditional Feistel structure.The SubColumns of round function is implemented by combining bit-slice technology with subkeys.The S-box is dynamically associated with the key.It has been demonstrated that DBST has a good avalanche effect,low hardware area,and high throughput.Our S-box has been proven to have fewer differential features than RECTANGLE S-box.The security analysis of DBST reveals that it can against impossible differential attack,differential attack,linear attack,and other types of attacks.展开更多
The substitution box(S-box)is a fundamentally important component of symmetric key cryptosystem.An S-box is a primary source of non-linearity in modern block ciphers,and it resists the linear attack.Various approaches...The substitution box(S-box)is a fundamentally important component of symmetric key cryptosystem.An S-box is a primary source of non-linearity in modern block ciphers,and it resists the linear attack.Various approaches have been adopted to construct S-boxes.S-boxes are commonly constructed over commutative and associative algebraic structures including Galois fields,unitary commutative rings and cyclic and non-cyclic finite groups.In this paper,first a non-associative ring of order 512 is obtained by using computational techniques,and then by this ring a triplet of 8×8 S-boxes is designed.The motivation behind the designing of these S-boxes is to upsurge the robustness and broaden the key space due to non-associative and noncommutative behavior of the algebraic structure under consideration.A novel color image encryption application is anticipated in which initially these 3 S-boxes are being used to produce confusion in three layers of a standard RGB image.However,for the sake of diffusion 3D Arnold chaotic map is used in the proposed encryption scheme.A comparison with some of existing chaos and S-box dependent color image encryption schemes specs the performance results of the anticipated RGB image encryption and observed as approaching the standard prime level.展开更多
The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet from unauthorized access.To improve data security,modern cryptos...The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet from unauthorized access.To improve data security,modern cryptosystems use substitution-boxes.Nowadays,data privacy has become a key concern for consumers who transfer sensitive data from one place to another.To address these problems,many companies rely on cryptographic techniques to secure data from illegal activities and assaults.Among these cryptographic approaches,AES is a well-known algorithm that transforms plain text into cipher text by employing substitution box(S-box).The S-box disguises the relationship between cipher text and the key to guard against cipher attacks.The security of a cipher using an S-box depends on the cryptographic strength of the respective S-box.Therefore,various researchers have employed different techniques to construct high order non-linear S-box.This paper provides a novel approach for evolving S-boxes using coset graphs for the action of the alternating group A5 over the finite field and the symmetric group S256.The motivation for this work is to study the symmetric group and coset graphs.The authors have performed various analyses against conventional security criteria such as nonlinearity,differential uniformity,linear probability,the bit independence criterion,and the strict avalanche criterion to determine its high cryptographic strength.To evaluate its image application performance,the proposed S-box is also used to encrypt digital images.The performance and comparison analyses show that the suggested S-box can secure data against cyber-attacks.展开更多
In order to improve communication security, proposed a chaotic block cryptographic scheme based on the coupled piecewise nonlinear map. Using the coupled chaotic systems to generate random binary sequences, a key-depe...In order to improve communication security, proposed a chaotic block cryptographic scheme based on the coupled piecewise nonlinear map. Using the coupled chaotic systems to generate random binary sequences, a key-dependent shill approach permated the plain-text block and then using the classical chaotic masking technique encrypted the plain-text block. Simulation results show that the proposed algorithm has excellent cryptographic properties such as diffusion and confusion properties and it can resist the know plaintext attacks and chosen plain-text attacks.展开更多
Highly nonlinear resilient functions play a crucial role in nonlinear combiners which are usual hardware oriented stream ciphers.During the past three decades,the main idea of construction of highly nonlinear resilien...Highly nonlinear resilient functions play a crucial role in nonlinear combiners which are usual hardware oriented stream ciphers.During the past three decades,the main idea of construction of highly nonlinear resilient functions are benefited from concatenating a large number of affine subfunctions.However,these resilient functions as core component of ciphers usually suffered from the guess and determine attack or algebraic attack since the n-variable nonlinear Boolean functions can be easily given rise to partial linear relations by fixing at most nil variables of them.How to design highly nonlinear resilient functions(S-boxes)without concatenating a large number of nil variables affine subfunctions appears to be an important task.In this article,a new construction of highly nonlinear resilient functions is proposed.These functions consist of two classes subfunctions.More specially,the first class(nonlinear part)contains both the bent functions with 2k variables and some affine subfUnctions with n/2-k variables which are attained by using[n/2-k,m,d]disjoint linear codes.The second class(linear part)includes some linear subfunctions with nil variables which are attained by using[n/2,m,d]disjoint linear codes.It is illustrated that these resilient functions have high nonlinearity and high algebraic degree.In particular,It is different from previous well-known resilient S-boxes,these new S-boxes cannot be directly decomposed into some affine subftinctions with nil variables by fixing at most nil variables.It means that the S-boxes(vectorial Boolean functions)which use these resilient functions as component functions have more favourable cryptography properties against the guess and determine attack or algebraic attacks.展开更多
In this paper, for the unbalanced Feistel network which employs diffusion matrices in a switching way, we study the fixed number of its differential active S-boxes. Firstly we obtain some lower bounds of the different...In this paper, for the unbalanced Feistel network which employs diffusion matrices in a switching way, we study the fixed number of its differential active S-boxes. Firstly we obtain some lower bounds of the differential active S-boxes for m, 2m and 3m rounds of Feistel structure, respectively. By concatenating these rounds, a fixed number of differential active S-boxes for arbitrary round number is derived. Our results imply that the unbalanced Feistel network using DSM is more secure than the traditional structure.展开更多
To evaluate the security of cipher algo- rithrrs with secret operations, we built a new reverse engineering analysis based on Differential Fault Analysis （DFA） to recover the secret S-boxes in Secret Private Network...To evaluate the security of cipher algo- rithrrs with secret operations, we built a new reverse engineering analysis based on Differential Fault Analysis （DFA） to recover the secret S-boxes in Secret Private Network （SPN） and Feistel structures, which are two of the most typical structures in block ciphers. This paper gives the general definitions of these two structures and proposes the reverse engineering analysis of each structure. Furthermore, we evaluate the complexity of the proposed reverse analyses and theoretically prove the effectiveness of the reverse method. For the Twoflsh-like and AES-like algorithrm, the experimental results verify the correctness and efficiency of the reverse analysis. The proposed reverse analysis can efficiently recover the secret S-boxes in the encryp＇don algorithms writh SPN and Feistel structures. It can successfully recover the Twoflsh- like algorithm in 2.3 s with 256 faults and the AES- like algorithm in 0.33 s with 23 faults.展开更多
文摘In block ciphers,the nonlinear components,also known as sub-stitution boxes(S-boxes),are used with the purpose of inducing confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Gaussian integers(GI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.But the prime field dependent on the Elliptic curve(EC)provides one S-box at a time by fixing three parameters a,b,and p.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.
基金extend their appreciation to the Deanship of Scientific Research at King Khalid University,for funding this work through the General Research Groups Program under Grant No.R.G.P.2/109/43.
文摘In block ciphers,the nonlinear components,also known as substitution boxes(S-boxes),are used with the purpose to induce confusion in cryptosystems.For the last decade,most of the work on designing S-boxes over the points of elliptic curves,chaotic maps,and Gaussian integers has been published.The main purpose of these studies is to hide data and improve the security levels of crypto algorithms.In this work,we design pair of nonlinear components of a block cipher over the residue class of Eisenstein integers(EI).The fascinating features of this structure provide S-boxes pair at a time by fixing three parameters.However,in the same way,by taking three fixed parameters only one S-box is obtained through a prime field-dependent Elliptic curve(EC),chaotic maps,and Gaussian integers.The newly designed pair of S-boxes are assessed by various tests like nonlinearity,bit independence criterion,strict avalanche criterion,linear approximation probability,and differential approximation probability.
文摘IoT devices have been widely used with the advent of 5G.These devices contain a large amount of private data during transmission.It is primely important for ensuring their security.Therefore,we proposed a lightweight block cipher based on dynamic S-box named DBST.It is introduced for devices with limited hardware resources and high throughput requirements.DBST is a 128-bit block cipher supporting 64-bit key,which is based on a new generalized Feistel variant structure.It retains the consistency and significantly boosts the diffusion of the traditional Feistel structure.The SubColumns of round function is implemented by combining bit-slice technology with subkeys.The S-box is dynamically associated with the key.It has been demonstrated that DBST has a good avalanche effect,low hardware area,and high throughput.Our S-box has been proven to have fewer differential features than RECTANGLE S-box.The security analysis of DBST reveals that it can against impossible differential attack,differential attack,linear attack,and other types of attacks.
文摘The substitution box(S-box)is a fundamentally important component of symmetric key cryptosystem.An S-box is a primary source of non-linearity in modern block ciphers,and it resists the linear attack.Various approaches have been adopted to construct S-boxes.S-boxes are commonly constructed over commutative and associative algebraic structures including Galois fields,unitary commutative rings and cyclic and non-cyclic finite groups.In this paper,first a non-associative ring of order 512 is obtained by using computational techniques,and then by this ring a triplet of 8×8 S-boxes is designed.The motivation behind the designing of these S-boxes is to upsurge the robustness and broaden the key space due to non-associative and noncommutative behavior of the algebraic structure under consideration.A novel color image encryption application is anticipated in which initially these 3 S-boxes are being used to produce confusion in three layers of a standard RGB image.However,for the sake of diffusion 3D Arnold chaotic map is used in the proposed encryption scheme.A comparison with some of existing chaos and S-box dependent color image encryption schemes specs the performance results of the anticipated RGB image encryption and observed as approaching the standard prime level.
文摘The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet from unauthorized access.To improve data security,modern cryptosystems use substitution-boxes.Nowadays,data privacy has become a key concern for consumers who transfer sensitive data from one place to another.To address these problems,many companies rely on cryptographic techniques to secure data from illegal activities and assaults.Among these cryptographic approaches,AES is a well-known algorithm that transforms plain text into cipher text by employing substitution box(S-box).The S-box disguises the relationship between cipher text and the key to guard against cipher attacks.The security of a cipher using an S-box depends on the cryptographic strength of the respective S-box.Therefore,various researchers have employed different techniques to construct high order non-linear S-box.This paper provides a novel approach for evolving S-boxes using coset graphs for the action of the alternating group A5 over the finite field and the symmetric group S256.The motivation for this work is to study the symmetric group and coset graphs.The authors have performed various analyses against conventional security criteria such as nonlinearity,differential uniformity,linear probability,the bit independence criterion,and the strict avalanche criterion to determine its high cryptographic strength.To evaluate its image application performance,the proposed S-box is also used to encrypt digital images.The performance and comparison analyses show that the suggested S-box can secure data against cyber-attacks.
基金supported by the National Natural Science Foundation of China under Grant No.10871106
文摘For a class of generalized Feistel block ciphers, an explicit formula for the minimum numbers of linearly active S-boxes of any round r is presented.
基金Supported by the National Natural Science Foun-dation of China (60573047) the Natural Science Foundation of Chongqing Science and Technology Committee (CSTC,2005B2286) the Applying Basic Research of Chongqing Education Committee(kj051501)
文摘In order to improve communication security, proposed a chaotic block cryptographic scheme based on the coupled piecewise nonlinear map. Using the coupled chaotic systems to generate random binary sequences, a key-dependent shill approach permated the plain-text block and then using the classical chaotic masking technique encrypted the plain-text block. Simulation results show that the proposed algorithm has excellent cryptographic properties such as diffusion and confusion properties and it can resist the know plaintext attacks and chosen plain-text attacks.
基金The work was supported in part by the National Natural Science Foundation of China(Grant No.61872103)in part by Guangxi Science and Technology Foundation(Guike AB18281019,Guike AD18281026)+1 种基金in part by Guangxi Natural Science Foundation(2019GXNSFGA245004)in part by the Foundation of Ministry of Education Key Laboratory of Cognitive Radio and Information Processing(Guilin University of Electronic Technology)(CRKL180107).
文摘Highly nonlinear resilient functions play a crucial role in nonlinear combiners which are usual hardware oriented stream ciphers.During the past three decades,the main idea of construction of highly nonlinear resilient functions are benefited from concatenating a large number of affine subfunctions.However,these resilient functions as core component of ciphers usually suffered from the guess and determine attack or algebraic attack since the n-variable nonlinear Boolean functions can be easily given rise to partial linear relations by fixing at most nil variables of them.How to design highly nonlinear resilient functions(S-boxes)without concatenating a large number of nil variables affine subfunctions appears to be an important task.In this article,a new construction of highly nonlinear resilient functions is proposed.These functions consist of two classes subfunctions.More specially,the first class(nonlinear part)contains both the bent functions with 2k variables and some affine subfUnctions with n/2-k variables which are attained by using[n/2-k,m,d]disjoint linear codes.The second class(linear part)includes some linear subfunctions with nil variables which are attained by using[n/2,m,d]disjoint linear codes.It is illustrated that these resilient functions have high nonlinearity and high algebraic degree.In particular,It is different from previous well-known resilient S-boxes,these new S-boxes cannot be directly decomposed into some affine subftinctions with nil variables by fixing at most nil variables.It means that the S-boxes(vectorial Boolean functions)which use these resilient functions as component functions have more favourable cryptography properties against the guess and determine attack or algebraic attacks.
基金Supported by the National Natural Science Foundation of China(11204379)Innovation Scientists and Technicians Troop Construction Projects of Henan Province(104100510025)
文摘In this paper, for the unbalanced Feistel network which employs diffusion matrices in a switching way, we study the fixed number of its differential active S-boxes. Firstly we obtain some lower bounds of the differential active S-boxes for m, 2m and 3m rounds of Feistel structure, respectively. By concatenating these rounds, a fixed number of differential active S-boxes for arbitrary round number is derived. Our results imply that the unbalanced Feistel network using DSM is more secure than the traditional structure.
基金This work was supported by the National Natural Science Foundation of China under Cxants No.60970116, No. 60970115, No. 61202386, No. 61003267.
文摘To evaluate the security of cipher algo- rithrrs with secret operations, we built a new reverse engineering analysis based on Differential Fault Analysis （DFA） to recover the secret S-boxes in Secret Private Network （SPN） and Feistel structures, which are two of the most typical structures in block ciphers. This paper gives the general definitions of these two structures and proposes the reverse engineering analysis of each structure. Furthermore, we evaluate the complexity of the proposed reverse analyses and theoretically prove the effectiveness of the reverse method. For the Twoflsh-like and AES-like algorithrm, the experimental results verify the correctness and efficiency of the reverse analysis. The proposed reverse analysis can efficiently recover the secret S-boxes in the encryp＇don algorithms writh SPN and Feistel structures. It can successfully recover the Twoflsh- like algorithm in 2.3 s with 256 faults and the AES- like algorithm in 0.33 s with 23 faults.
