Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Modified genetic algorithms for generating S-boxes with high nonlinearity

View through CrossRef
This article discusses the use of modified genetic algorithms to generate S-boxes with high nonlinearity, which is critical for ensuring the security of cryptographic algorithms. S-boxes play a key role in providing resistance to cryptanalysis, in particular to linear and differential cryptanalysis attacks. In the course of the study, a series of experiments were conducted using a genetic algorithm modified by additional storage of the current population and the use of selection. This approach has significantly improved the efficiency of the algorithm compared to the classical genetic algorithm. The best results were achieved with the minimum number of instances in the population and the optimal number of mutations. It was found that the algorithm finds S-blocks with a probability of 99% with a nonlinearity of 104, which demonstrates its high efficiency. The results of the study showed that the modified algorithm is able to provide stable generation of S-boxes with the required attack resistance properties. The proposed method also proved to be flexible in parameter settings, which allows it to be adapted for various cryptographic applications. The paper also discusses the possibilities of further improving the algorithm, including the study of other mutation and selection methods, as well as parameter optimization to achieve even better results. Additionally, the possibility of using distributed computing to increase the speed of S-boxes generation is considered. The results of the study indicate the prospects of the proposed approach for creating attack-resistant cryptographic systems. This study considered the use of genetic algorithms to generate S-boxes with high nonlinearity. The proposed approach was based on the use of an objective function with optimal parameters, which allowed achieving high efficiency in generating bioactive S-blocks. The proposed algorithm showed high stability and efficiency in generating S-boxes with nonlinearity, which is confirmed by a 99% probability of achieving the goal. These results indicate the prospects of using genetic algorithms in cryptographic applications that require high resistance to attacks. In future research, it is planned to further improve the algorithm by exploring other methods of mutation and selection, as well as optimizing parameters to achieve even better results. In addition, it is possible to use distributed computing to further speed up the process of generating S-boxes.
Title: Modified genetic algorithms for generating S-boxes with high nonlinearity
Description:
This article discusses the use of modified genetic algorithms to generate S-boxes with high nonlinearity, which is critical for ensuring the security of cryptographic algorithms.
S-boxes play a key role in providing resistance to cryptanalysis, in particular to linear and differential cryptanalysis attacks.
In the course of the study, a series of experiments were conducted using a genetic algorithm modified by additional storage of the current population and the use of selection.
This approach has significantly improved the efficiency of the algorithm compared to the classical genetic algorithm.
The best results were achieved with the minimum number of instances in the population and the optimal number of mutations.
It was found that the algorithm finds S-blocks with a probability of 99% with a nonlinearity of 104, which demonstrates its high efficiency.
The results of the study showed that the modified algorithm is able to provide stable generation of S-boxes with the required attack resistance properties.
The proposed method also proved to be flexible in parameter settings, which allows it to be adapted for various cryptographic applications.
The paper also discusses the possibilities of further improving the algorithm, including the study of other mutation and selection methods, as well as parameter optimization to achieve even better results.
Additionally, the possibility of using distributed computing to increase the speed of S-boxes generation is considered.
The results of the study indicate the prospects of the proposed approach for creating attack-resistant cryptographic systems.
This study considered the use of genetic algorithms to generate S-boxes with high nonlinearity.
The proposed approach was based on the use of an objective function with optimal parameters, which allowed achieving high efficiency in generating bioactive S-blocks.
The proposed algorithm showed high stability and efficiency in generating S-boxes with nonlinearity, which is confirmed by a 99% probability of achieving the goal.
These results indicate the prospects of using genetic algorithms in cryptographic applications that require high resistance to attacks.
In future research, it is planned to further improve the algorithm by exploring other methods of mutation and selection, as well as optimizing parameters to achieve even better results.
In addition, it is possible to use distributed computing to further speed up the process of generating S-boxes.

Related Results

Testing multichambered bat box designs in a habitat-offset area in eastern Australia: influence of material, colour, size and box host
Testing multichambered bat box designs in a habitat-offset area in eastern Australia: influence of material, colour, size and box host
Bat boxes are frequently used as conservation and habitat-offset measures, yet their effectiveness is equivocal, particularly in Australia. Boxes used in Australia are largely volu...
A Novel Algorithm of Constructing Highly Nonlinear S-p-boxes
A Novel Algorithm of Constructing Highly Nonlinear S-p-boxes
The role of substitution boxes is very important in block ciphers. Substitution boxes are utilized to create confusion in the cryptosystem. However, to create both confusion and di...
Section-level genome sequencing and comparative genomics of Aspergillus sections Cavernicolus and Usti
Section-level genome sequencing and comparative genomics of Aspergillus sections Cavernicolus and Usti
Fig. S1. A cladogram representation of the phylogenetic relations between the species in this paper. The red labels show bootstrap values of 100 % and the black labels show bootstr...
Optimizing Hill Climbing Algorithm Parameters for Generation of Cryptographically Strong S-Boxes
Optimizing Hill Climbing Algorithm Parameters for Generation of Cryptographically Strong S-Boxes
Abstract Nonlinear substitutions (S-boxes) are an important component of modern symmetric ciphers. They are designed to complicate the plaintext-ciphertext dependency. Acco...
Behaviour of Silver Foxes in Traditional Breeding Boxes and in Boxes With an Entrance Tunnel
Behaviour of Silver Foxes in Traditional Breeding Boxes and in Boxes With an Entrance Tunnel
AbstractThe periparturient behaviour of silver-fox females inside traditional and modified breeding boxes was video-recorded. The behaviour was analysed from 24 hours before partur...
On the practical usage of genetic algorithms in ecology and evolution
On the practical usage of genetic algorithms in ecology and evolution
Summary Genetic algorithms are a heuristic global optimisation technique mimicking the action of natural selection to solve hard optimisation problems, which has enjoyed growing u...
Optimization of local search algorithm parameters for generating nonlinear substitutions
Optimization of local search algorithm parameters for generating nonlinear substitutions
Nonlinear substitutions (S-boxes) are an important component of modern symmetric cryptography algorithms. They complicate symmetric transformations and introduce nonlinearity into ...

Back to Top