Yuliia Zaichenko

Yuliia Zaichenko

Auto-generated profile, based on publicly available information

Yuliia Zaichenko

V. N. Karazin Kharkiv National University,Department of information systems and technologies security,Kharkiv,Ukraine

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 October 2021
Verified
Conference Paper
Closed access
Oleksandr KuznetsovOleksandr Kuznetsov
Oleksandr Kuznetsov
NPNikolay Poluyanenko
Nikolay Poluyanenko
SKSerhii Kandii
Serhii Kandii
YZYuliia Zaichenko
Yuliia Zaichenko
DPDmytro Igorovych Prokopovych-Tkachenko
Dmytro Igorovych Prokopovych-Tkachenko
TKTatiana Katkova
Tatiana Katkova
Nonlinear substitutions (S-boxes) are an important component of modern symmetric cryptography algorithms. They complicate symmetric transformations and introduce nonlinearity in the input-output relationship, which provides resistance to some cryptanalysis techniques. S-boxes generation can be done in a number of ways. However, the most promising are heuristic techniques. On the one hand, the generated S-boxes look like random settings, which complicates algebraic cryptanalysis. On the other hand, heuristic search makes it possible to achieve high nonlinearity and δ-uniformity, which complicates linear and differential cryptanalysis. In this article, we will explore 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. We optimize the algorithm parameters and show that with the chosen parameters it is possible to reliably form S-boxes with nonlinearity 104.

5 October 2021
Verified
Conference Paper
Closed access
Oleksandr KuznetsovOleksandr Kuznetsov
Oleksandr Kuznetsov
NPNikolay Poluyanenko
Nikolay Poluyanenko
SKSerhii Kandii
Serhii Kandii
YZYuliia Zaichenko
Yuliia Zaichenko
DPDmytro Igorovych Prokopovych-Tkachenko
Dmytro Igorovych Prokopovych-Tkachenko
TKTatiana Katkova
Tatiana Katkova
Nonlinear substitution boxes (S-boxes) use in most modern symmetric cryptoalgorithms. They are designed to mix input data and take the essential part in ensuring resistance against known cryptoanalytic attacks (differential, linear, algebraic and other methods of cryptoanalysis). However, the random formation of nonlinear substitutions with the required rates is an extremely complex mathematical problem. We observe the heuristic techniques of S-boxes informed search, in particular, we consider the cost function used in most known algorithms (eg, local search, gradient lift, annealing simulation, genetic search, etc.). The purpose of our research is to determine the specific parameters of the heuristic function, which on the one hand do not reduce the degree of awareness of search nodes, and on the other hand do not require significant computational costs. We investigate the influence of individual parameters on the value of the cost function and on the complexity of its calculation. We also provide specific recommendations for the formation of parameters for the heuristic search of S-boxes.

24 September 2021 in Radiotekhnika
Verified
Journal Article
Open access
PDF file
Oleksandr KuznetsovOleksandr Kuznetsov
Oleksandr Kuznetsov
NPN.A. Poluyanenko
N.A. Poluyanenko
VKV.A. Katrich
V.A. Katrich
SKSerhii Kandii
Serhii Kandii
YZYu.A. Zaichenko
Yu.A. Zaichenko
Nonlinear substitutions (S-boxes) are used in most modern symmetric cryptoalgorithms. They are designed to mix input data and play a significant role in ensuring resistance against known cryptanalytic attacks (differential, linear, algebraic and other cryptanalysis methods). However, random generation of nonlinear substitutions with the desired indicators is an extremely difficult mathematical problem. This article explores the heuristic techniques for S-boxes informed search, in particular, discusses various cost functions used in most of the known algorithms (for example, local search, hill climbing, simulated annealing, genetic search, etc.). The aim of the study is to determine the specific parameters of heuristic functions, which, on the one hand, do not reduce the degree of awareness of the search nodes, and on the other hand, do not require significant computational costs. The article examines the influence of individual parameters on the value of the cost function and complexity of its calculation. It also provides specific recommendations for the formation of parameters for heuristic search for S-boxes, which significantly affect the efficiency of generating nonlinear substitutions for symmetric cryptography.

24 September 2021 in Radiotekhnika
Verified
Journal Article
Open access
PDF file
Oleksandr KuznetsovOleksandr Kuznetsov
Oleksandr Kuznetsov
NPN.A. Poluyanenko
N.A. Poluyanenko
SBS.L. Berdnik
S.L. Berdnik
SKSerhii Kandii
Serhii Kandii
YZYu.A. Zaichenko
Yu.A. Zaichenko
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.