Nataliya Zagorodna
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nataliya Zagorodna has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Mikolaj Karpinski
Department of Software Engineering, University of the National Education Commission, 30-084 Krakow, Poland
2 shared publications - Aigul Shaikhanova
Department of Information Security, L.N. Gumilyov Eurasian National University, Satpayev 2, 010008 Astana, Kazakhstan
1 shared publication - Aizhan Tokkuliyeva
L.N. Gumilyov Eurasian National University
1 shared publication - Anna Korchenko
Dnipro University of Technology
1 shared publication - Artem Sokolov
Department of Cybersecurity, National University “Odesa Law Academy”, 65009 Odesa, Ukraine
1 shared publication - Mykhailo Kasianchuk
Department of Cyber Security, West Ukrainian National University, 46009 Ternopil, Ukraine
1 shared publication
Latest Publications
- Open Access
- 21 May 2025
- Published by MDPI AG in Electronics
- Vol. 14 (10) , 2094
Development of High-Quality Cryptographic Constructions Based on Many-Valued Logic Affine Transformations
The S-box is a key component of modern ciphers, determining the quality and performance of the cryptographic algorithms in which it is applied. Many constructions for synthesizing high-quality S-boxes have been established, and those based on Galois fields theory—for example, the Nyberg construction applied in the AES cryptographic algorithm—are particularly important. An integral component of the Nyberg construction is the affine transformation, which is used to improve the avalanche and correlation properties of the S-box. In this paper, a new approach is adopted for synthesizing affine transformations for S-boxes based on the quaternary matrices over the Galois field GF(4). We describe four basic structures that serve as the foundation for synthesizing a complete class of 648 affine transformation matrices of order n = 3 and a class of 7776 matrices of order n = 4 and introduce a recurrent structure to facilitate the synthesis of matrices for higher orders. Using these matrices in combination with the Nyberg construction, it is possible to construct bijective S-boxes that outperform the original Nyberg construction and many other known S-boxes in terms of strict avalanche criterion (SAC) and bit independence criterion strict avalanche criterion (BIC SAC) values, while maintaining a maximal level of nonlinearity and good cryptographic properties. We also propose modified GF(4) affine transformations that can be applied to specialized S-boxes which already satisfy the SAC for both component Boolean and 4-functions, as well as the criterion of minimal correlation between input and output, allowing us to enhance their nonlinearity to the value of Nf = 96. We integrate the synthesized S-boxes into the AES algorithm and evaluate their practical performance. The encryption outputs successfully pass the NIST statistical test suite in 96 out of 100 cases, outperforming both the original AES S-box and other reference constructions, confirming the practical strength of the proposed method.
- 21 May 2025
- Published by MDPI AG in Electronics
- Vol. 14 (10) , 2094
Open AccessDevelopment of High-Quality Cryptographic Constructions Based on Many-Valued Logic Affine Transformations
The S-box is a key component of modern ciphers, determining the quality and performance of the cryptographic algorithms in which it is applied. Many constructions for synthesizing high-quality S-boxes have been established, and those based on Galois fields theory—for example, the Nyberg construction applied in the AES cryptographic algorithm—are particularly important. An integral component of the Nyberg construction is the affine transformation, which is used to improve the avalanche and correlation properties of the S-box. In this paper, a new approach is adopted for synthesizing affine transformations for S-boxes based on the quaternary matrices over the Galois field GF(4). We describe four basic structures that serve as the foundation for synthesizing a complete class of 648 affine transformation matrices of order n = 3 and a class of 7776 matrices of order n = 4 and introduce a recurrent structure to facilitate the synthesis of matrices for higher orders. Using these matrices in combination with the Nyberg construction, it is possible to construct bijective S-boxes that outperform the original Nyberg construction and many other known S-boxes in terms of strict avalanche criterion (SAC) and bit independence criterion strict avalanche criterion (BIC SAC) values, while maintaining a maximal level of nonlinearity and good cryptographic properties. We also propose modified GF(4) affine transformations that can be applied to specialized S-boxes which already satisfy the SAC for both component Boolean and 4-functions, as well as the criterion of minimal correlation between input and output, allowing us to enhance their nonlinearity to the value of Nf = 96. We integrate the synthesized S-boxes into the AES algorithm and evaluate their practical performance. The encryption outputs successfully pass the NIST statistical test suite in 96 out of 100 cases, outperforming both the original AES S-box and other reference constructions, confirming the practical strength of the proposed method.
- Top Cited PapersOpen Access
- 3 March 2023
- Published by MDPI AG in Information
- Vol. 14 (3) , 161
Prediction Machine Learning Models on Propensity Convicts to Criminal Recidivism
Increasing internal state security requires an understanding of the factors that influence the commission of repetitive crimes (recidivism) since the crime is not caused by public danger but by the criminal person. Against the background of informatization of the information activities of law enforcement agencies, there is no doubt about the expediency of using artificial intelligence algorithms and blockchain technology to predict and prevent crimes. The prediction machine-learning models for identifying significant factors (individual characteristics of convicts), which affect the propensity to commit criminal recidivism, were applied in this article. For predicting the probability of propensity for criminal recidivism of customers of Ukrainian penitentiary institutions, a Decision Tree model was built to suggest the probability of repeated criminal offenses by convicts. It was established that the number of convictions to the actual punishment and suspended convictions is the main factors that determine the propensity of customers of penitentiary institutions to commit criminal recidivism in the future. Decision Tree models for the classification of convicts prone or not prone to recidivism were built. They can be used to predict new cases for decision-making support in criminal justice. In our further research, the possibility of using the technology of distributed registers/blockchain in predictive criminology will be analyzed.
- 3 March 2023
- Published by MDPI AG in Information
- Vol. 14 (3) , 161
Top Cited PapersOpen AccessPrediction Machine Learning Models on Propensity Convicts to Criminal Recidivism
Increasing internal state security requires an understanding of the factors that influence the commission of repetitive crimes (recidivism) since the crime is not caused by public danger but by the criminal person. Against the background of informatization of the information activities of law enforcement agencies, there is no doubt about the expediency of using artificial intelligence algorithms and blockchain technology to predict and prevent crimes. The prediction machine-learning models for identifying significant factors (individual characteristics of convicts), which affect the propensity to commit criminal recidivism, were applied in this article. For predicting the probability of propensity for criminal recidivism of customers of Ukrainian penitentiary institutions, a Decision Tree model was built to suggest the probability of repeated criminal offenses by convicts. It was established that the number of convictions to the actual punishment and suspended convictions is the main factors that determine the propensity of customers of penitentiary institutions to commit criminal recidivism in the future. Decision Tree models for the classification of convicts prone or not prone to recidivism were built. They can be used to predict new cases for decision-making support in criminal justice. In our further research, the possibility of using the technology of distributed registers/blockchain in predictive criminology will be analyzed.