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

Optimization of local search algorithm parameters for generating nonlinear substitutions

View through CrossRef
Nonlinear substitutions (S-boxes) are an important component of modern symmetric cryptography algorithms. They complicate symmetric transformations and introduce nonlinearity into the input-output relationship, which ensures the stability of the algorithms against some cryptanalysis methods. Generation of S-boxes can be done in different ways. However, heuristic techniques are the most promising ones. On the one hand, the generated S-boxes are in the form of random substitutions, which complicates algebraic cryptanalysis. On the other hand, heuristic search allows one to achieve high rates of nonlinearity and δ-uniformity, which complicates linear and differential cryptanalysis. This article studies the simplest local search algorithm for generating S-boxes. To assess the efficiency of the algorithm, the concept of a track of a cost function is introduced in the article. Numerous experiments are carried out, in particular, the influence of the number of internal and external loops of local search on the complexity of generating the target S-box is investigated. The optimal (from the point of view of minimum time consumption) parameters of the local search algorithm for generating S-blocks with a target nonlinearity of 104 and the number of parallel computing threads 30 are substantiated. It is shown that with the selected (optimal) parameters it is possible to reliably form S-blocks with a nonlinearity of 104.
Title: Optimization of local search algorithm parameters for generating nonlinear substitutions
Description:
Nonlinear substitutions (S-boxes) are an important component of modern symmetric cryptography algorithms.
They complicate symmetric transformations and introduce nonlinearity into the input-output relationship, which ensures the stability of the algorithms against some cryptanalysis methods.
Generation of S-boxes can be done in different ways.
However, heuristic techniques are the most promising ones.
On the one hand, the generated S-boxes are in the form of random substitutions, which complicates algebraic cryptanalysis.
On the other hand, heuristic search allows one to achieve high rates of nonlinearity and δ-uniformity, which complicates linear and differential cryptanalysis.
This article studies the simplest local search algorithm for generating S-boxes.
To assess the efficiency of the algorithm, the concept of a track of a cost function is introduced in the article.
Numerous experiments are carried out, in particular, the influence of the number of internal and external loops of local search on the complexity of generating the target S-box is investigated.
The optimal (from the point of view of minimum time consumption) parameters of the local search algorithm for generating S-blocks with a target nonlinearity of 104 and the number of parallel computing threads 30 are substantiated.
It is shown that with the selected (optimal) parameters it is possible to reliably form S-blocks with a nonlinearity of 104.

Related Results

Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Objective: To determine the frequency of common chromosomal aberrations in local population idiopathic determine the frequency of common chromosomal aberrations in local population...
An improved Coati Optimization Algorithm with multiple strategies for engineering design optimization problems
An improved Coati Optimization Algorithm with multiple strategies for engineering design optimization problems
AbstractAiming at the problems of insufficient ability of artificial COA in the late optimization search period, loss of population diversity, easy to fall into local extreme value...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
A NEW MULTI-OBJECTIVE ARITHMETIC OPTIMIZATION ALGORITHM
A NEW MULTI-OBJECTIVE ARITHMETIC OPTIMIZATION ALGORITHM
Today, as engineering problems become more complex in terms of the effective variables in these problems and the range of their changes and their multidimensionality (in terms of n...
Factorial number system for nonlinear substitutions generation
Factorial number system for nonlinear substitutions generation
Modern cryptographic applications use cryptographic algorithms with a symmetric key. They provide high conversion rates and resistance to crypto-graphic attacks. To complicate the ...
Improved electrical coupling integrated energy system based on particle swarm optimization
Improved electrical coupling integrated energy system based on particle swarm optimization
AbstractThe rational utilization of energy is an important issue for sustainable development. Electrically coupled integrated energy systems can enhance energy utilization efficien...
Evaluating the Science to Inform the Physical Activity Guidelines for Americans Midcourse Report
Evaluating the Science to Inform the Physical Activity Guidelines for Americans Midcourse Report
Abstract The Physical Activity Guidelines for Americans (Guidelines) advises older adults to be as active as possible. Yet, despite the well documented benefits of physical activi...

Back to Top