Iryna Lysytska
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Iryna Lysytska has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
K.E. Lysytskyi
2 shared publications- Yevheniia Pavlivna Kolovanova
V. N. Karazin Kharkiv National University
2 shared publications I.M. Galtseva
1 shared publicationI.M. Haltseva
1 shared publicationK.YE. Lysytskyi
Харківський національний університет імені В.Н. Каразіна
1 shared publication- Konstantin Lisickiy
V. N. Karazin, Kharkiv National University
1 shared publication
Latest Publications
- 24 December 2025
- Published by Kharkiv National University of Radioelectronics in Radiotekhnika
- No. 223,p. 31-37
Evolution of block symmetric cipher architectures
The article presents an analysis of the evolution and design principles of block symmetric ciphers (BSCs), which are a direct implementation of the fundamental ideas of Claude Shannon. A detailed comparative analysis of two classical iterative architectures is carried out, namely, the Feistel Network (FN) and the Substitution-Permutation Network (SPN), which have become the basis for most modern standards (including DES and AES). The key differences in their reversibility, requirements for the round function and diffusion rate are considered. Additionally, alternative designs such as the Leigh-Massey (LM) Network and the Generalized Feistel (GFN) Network, ARX (Add-Rotate-XOR) ciphers are investigated, emphasizing their role in providing faster diffusion and flexibility. Three main directions of modern adaptation of BSNs are highlighted: Performance on powerful processors: dominance of ARX (Add-Rotate-XOR) designs that replace traditional S-blocks with operations efficient for 32/64-bit architectures (e.g., ChaCha20); Post-quantum stability: it is substantiated that BSNs such as AES-256 remain resistant to Grover's attack by doubling the key length; Minimalism and Lightweight Cryptography: changing priorities to energy efficiency and minimizing hardware costs for IoT devices. This has led to the development of ciphers with very small S-blocks (like PRESENT), which compensate for the weaker round function by significantly increasing the number of rounds. Thus, the article demonstrates that the architecture of BSS is a dynamic field that successfully evolves, effectively adapting to both theoretical threats (quantum computing) and hard practical hardware limitations.
- 24 December 2025
- Published by Kharkiv National University of Radioelectronics in Radiotekhnika
- No. 223,p. 31-37
Evolution of block symmetric cipher architectures
The article presents an analysis of the evolution and design principles of block symmetric ciphers (BSCs), which are a direct implementation of the fundamental ideas of Claude Shannon. A detailed comparative analysis of two classical iterative architectures is carried out, namely, the Feistel Network (FN) and the Substitution-Permutation Network (SPN), which have become the basis for most modern standards (including DES and AES). The key differences in their reversibility, requirements for the round function and diffusion rate are considered. Additionally, alternative designs such as the Leigh-Massey (LM) Network and the Generalized Feistel (GFN) Network, ARX (Add-Rotate-XOR) ciphers are investigated, emphasizing their role in providing faster diffusion and flexibility. Three main directions of modern adaptation of BSNs are highlighted: Performance on powerful processors: dominance of ARX (Add-Rotate-XOR) designs that replace traditional S-blocks with operations efficient for 32/64-bit architectures (e.g., ChaCha20); Post-quantum stability: it is substantiated that BSNs such as AES-256 remain resistant to Grover's attack by doubling the key length; Minimalism and Lightweight Cryptography: changing priorities to energy efficiency and minimizing hardware costs for IoT devices. This has led to the development of ciphers with very small S-blocks (like PRESENT), which compensate for the weaker round function by significantly increasing the number of rounds. Thus, the article demonstrates that the architecture of BSS is a dynamic field that successfully evolves, effectively adapting to both theoretical threats (quantum computing) and hard practical hardware limitations.
- 18 September 2025
- Published by Kharkiv National University of Radioelectronics in Radiotekhnika
- No. 222,p. 62-68
Features of constructing nonlinear transformations of block symmetric ciphers
The article is devoted to the peculiarities of constructing nonlinear transformations of block symmetric ciphers. The history of the emergence of nonlinear transformations of block symmetric ciphers is briefly reviewed and the evolution of block symmetric ciphers after DES. The paper analyzes the methods of constructing S-blocks (Substitution-boxes), which are the main component that implements nonlinear substitutions and ensures cryptographic stability of the block symmetric cipher. The authors investigate and compare four main types of S-blocks: deterministic (fixed), dynamic (key-dependent), chaotically generated and random ones. The article analyzes in detail the advantages and disadvantages of each approach, as well as the key cryptographic properties ensuring that ensure stable nonlinear transformations, such as high nonlinearity, low differential homogeneity, bijectivity, avalanche effect, balance, high algebraic degree. The influence of post-quantum cryptography conditions is considered, in particular, the opposition to the Grover algorithm. The authors conclude that the choice of the S-block structure is a compromise between security, performance and ease of implementation. In the context of post-quantum symmetric block ciphers, the use of verified, fixed S-blocks combined with a key length sufficient to protect against quantum attacks is preferred. The reasons are the same as in the classical case: the complexity of security analysis, the computational cost of generation, and the problems associated with reproducibility. However, hybrid approaches combining algebraic and heuristic methods can also be used to achieve optimal results.
- 18 September 2025
- Published by Kharkiv National University of Radioelectronics in Radiotekhnika
- No. 222,p. 62-68
Features of constructing nonlinear transformations of block symmetric ciphers
The article is devoted to the peculiarities of constructing nonlinear transformations of block symmetric ciphers. The history of the emergence of nonlinear transformations of block symmetric ciphers is briefly reviewed and the evolution of block symmetric ciphers after DES. The paper analyzes the methods of constructing S-blocks (Substitution-boxes), which are the main component that implements nonlinear substitutions and ensures cryptographic stability of the block symmetric cipher. The authors investigate and compare four main types of S-blocks: deterministic (fixed), dynamic (key-dependent), chaotically generated and random ones. The article analyzes in detail the advantages and disadvantages of each approach, as well as the key cryptographic properties ensuring that ensure stable nonlinear transformations, such as high nonlinearity, low differential homogeneity, bijectivity, avalanche effect, balance, high algebraic degree. The influence of post-quantum cryptography conditions is considered, in particular, the opposition to the Grover algorithm. The authors conclude that the choice of the S-block structure is a compromise between security, performance and ease of implementation. In the context of post-quantum symmetric block ciphers, the use of verified, fixed S-blocks combined with a key length sufficient to protect against quantum attacks is preferred. The reasons are the same as in the classical case: the complexity of security analysis, the computational cost of generation, and the problems associated with reproducibility. However, hybrid approaches combining algebraic and heuristic methods can also be used to achieve optimal results.
- Open Access
- 19 June 2025
- Published by Kharkiv National University of Radioelectronics in Radiotekhnika
- No. 221,p. 51-56
The idea of cracking a hash function at quantum speed
The scientific article reviews and analyzes the current stage of cryptography development in the context of the inevitable post-quantum era. It is emphasized that post-quantum cryptography (PQC) is gaining the status of a key priority in the national security strategies of the world's leading developed countries, which are actively preparing for a fundamental transition to quantum-safe cryptographic practices. The consequence of the above is the urgent need for intensive development of the latest cryptographic algorithms, which by their nature will be resistant to attacks from powerful quantum computers. Today, several promising approaches to the creation of such quantum-safe algorithms based on various mathematical concepts and cryptographic primitives are already being actively studied. The article pays special attention to cryptography based on hash functions, which is considered one of the most promising areas in the context of developing reliable quantum-safe cryptographic tools. The potential for cracking cryptographic hash functions using quantum algorithms is analyzed. The article considers an original approach to assessing the quantum stability of hash functions, which consists in encoding the hash function itself in a quantum oracle, rather than its separate solution. A simplified (toy) hash function is used to clearly demonstrate the proposed idea. Based on the results of the experimental study, important conclusions are formulated, which indicate that quantum computers are indeed capable of significantly accelerating the process of inversion of cryptographic hash functions. This, in turn, provides strong grounds for serious concern about the cryptographic stability of various cryptographic primitives based on combinatorial problems. It is worth emphasizing that this problem is not limited to hash functions. This critically important observation means that to maintain a similar level of cryptographic security in the coming quantum era, the size of the input value of hash functions will likely need to be increased by at least half to compensate for the speedup provided by quantum algorithms.
- 19 June 2025
- Published by Kharkiv National University of Radioelectronics in Radiotekhnika
- No. 221,p. 51-56
Open AccessThe idea of cracking a hash function at quantum speed
The scientific article reviews and analyzes the current stage of cryptography development in the context of the inevitable post-quantum era. It is emphasized that post-quantum cryptography (PQC) is gaining the status of a key priority in the national security strategies of the world's leading developed countries, which are actively preparing for a fundamental transition to quantum-safe cryptographic practices. The consequence of the above is the urgent need for intensive development of the latest cryptographic algorithms, which by their nature will be resistant to attacks from powerful quantum computers. Today, several promising approaches to the creation of such quantum-safe algorithms based on various mathematical concepts and cryptographic primitives are already being actively studied. The article pays special attention to cryptography based on hash functions, which is considered one of the most promising areas in the context of developing reliable quantum-safe cryptographic tools. The potential for cracking cryptographic hash functions using quantum algorithms is analyzed. The article considers an original approach to assessing the quantum stability of hash functions, which consists in encoding the hash function itself in a quantum oracle, rather than its separate solution. A simplified (toy) hash function is used to clearly demonstrate the proposed idea. Based on the results of the experimental study, important conclusions are formulated, which indicate that quantum computers are indeed capable of significantly accelerating the process of inversion of cryptographic hash functions. This, in turn, provides strong grounds for serious concern about the cryptographic stability of various cryptographic primitives based on combinatorial problems. It is worth emphasizing that this problem is not limited to hash functions. This critically important observation means that to maintain a similar level of cryptographic security in the coming quantum era, the size of the input value of hash functions will likely need to be increased by at least half to compensate for the speedup provided by quantum algorithms.
- Open Access
- 25 November 2024
- Published by V. N. Karazin Kharkiv National University in Bulletin of V.N. Karazin Kharkiv National University, series «Mathematical modeling. Information technology. Automated control systems»
- Vol. 63 (63) , 6-16
Theoretical implementation and testing of the first stage of the ZK-STARK protocol “Arithmetisation”
Relevance: Starting with the invention of the Internet, the world began to change rapidly, and the pace of change is increasing, so the problem of data storage and processing is becoming more and more relevant. The ZK-STARK protocol is a new cryptographic zero-knowledge proof protocol that is not yet widely used in practice and allows you to check a message or a transaction on the blockchain network for authenticity without reproducing it completely. At the moment, gaps and problems related to this protocol are identified: computational complexity, possible poor compatibility with other protocols, and resistance to attacks from quantum computers. Therefore, the paper aims to supplement the coverage of the problem associated with computational complexity and to propose solutions to this problem. Purpose: on the basis of the theoretical implementation of the first stage named Arithmetization of the ZK-STARK protocol, to test its software implementation in order to provide recommendations on its most computationally efficient version. Research methods: mathematical statements on interpolation theory, group theory, number theory; information on Fibonacci numbers; information on the Euler function; generating element of a group; cyclic groups; Lagrange interpolation polynomial and the sequence of calculations of Arithmetization; Visual Studio 2022 programming environment, C++ programming language, NTL library, Microsoft Excel. Results of work: The result of the work is the theoretical implementation of the first stage of the ZK-STARK protocol and the effectiveness testing of the first stage, and providing recommendations for its most effective version. Conclusion: Testing has shown that the practical implementation of the Arithmetization based on the inverse fast Fourier transform has a time complexity , that is in times less than the time complexity of the Arithmetization based on inverse matrices method and Gaussian method for interpolation, that speeds up the work of Arithmetization of the ZK-STARK protocol.
- 25 November 2024
- Published by V. N. Karazin Kharkiv National University in Bulletin of V.N. Karazin Kharkiv National University, series «Mathematical modeling. Information technology. Automated control systems»
- Vol. 63 (63) , 6-16
Open AccessTheoretical implementation and testing of the first stage of the ZK-STARK protocol “Arithmetisation”
Relevance: Starting with the invention of the Internet, the world began to change rapidly, and the pace of change is increasing, so the problem of data storage and processing is becoming more and more relevant. The ZK-STARK protocol is a new cryptographic zero-knowledge proof protocol that is not yet widely used in practice and allows you to check a message or a transaction on the blockchain network for authenticity without reproducing it completely. At the moment, gaps and problems related to this protocol are identified: computational complexity, possible poor compatibility with other protocols, and resistance to attacks from quantum computers. Therefore, the paper aims to supplement the coverage of the problem associated with computational complexity and to propose solutions to this problem. Purpose: on the basis of the theoretical implementation of the first stage named Arithmetization of the ZK-STARK protocol, to test its software implementation in order to provide recommendations on its most computationally efficient version. Research methods: mathematical statements on interpolation theory, group theory, number theory; information on Fibonacci numbers; information on the Euler function; generating element of a group; cyclic groups; Lagrange interpolation polynomial and the sequence of calculations of Arithmetization; Visual Studio 2022 programming environment, C++ programming language, NTL library, Microsoft Excel. Results of work: The result of the work is the theoretical implementation of the first stage of the ZK-STARK protocol and the effectiveness testing of the first stage, and providing recommendations for its most effective version. Conclusion: Testing has shown that the practical implementation of the Arithmetization based on the inverse fast Fourier transform has a time complexity , that is in times less than the time complexity of the Arithmetization based on inverse matrices method and Gaussian method for interpolation, that speeds up the work of Arithmetization of the ZK-STARK protocol.
- Open Access
- 29 September 2023
- Published by National Aerospace University - Kharkiv Aviation Institute in RADIOELECTRONIC AND COMPUTER SYSTEMS
- No. 3,p. 150-158
The influence of S-boxes on the arrival of the cipher to the state of random substitution
The subject of this study is the process of developing block symmetric ciphers with improved cryptographic stability indicators for solving the problems of information protection in information and communication systems. The goal of this study is to develop a mathematical model of the optimal s-box design (non-linear substitution block) for modern block symmetric ciphers. Task: to show that the stability of block symmetric ciphers does not significantly depend on the indicators of the s-boxes included in these ciphers; to justify their use without reducing the stability of random substitutions as s-box constructions of modern block symmetric ciphers; and to prove the futility of searching for s-boxes with special properties. The methods used are: methods of probability theory; mathematical statistics; combinatorics and system analysis; methods of statistical tests; and methods of Boolean algebra. The following results were obtained. In modern ciphers, nonlinear substitution transformations are used as S-boxes (in most ciphers, byte substitutions are used). S-boxes perform the main function of encryption transformation - mixing of text bits. Dynamic indicators of the arrival of the cipher in the state of random substitution depend on their effectiveness. The presented results confirm that the indicators of cipher stability do not significantly depend on the indicators of the S-boxes included in the ciphers. It is not the individual properties of substitutions, but the results of their sequential interactions decisive for achieving stability indicators. It is shown that the fee for encryption is chosen to be three to four times greater than the depth of the avalanche effect - the minimum number of cycles of the cipher’s arrival to the state of random substitution) is hardly noticeable. Conclusions. The scientific novelty of the obtained results is as follows. This work represents a generalization of the transition to the use of random permutations as S-boxes is an increase of only one cycle in the number of cycles of the arrival of the cipher to the state of random permutations, and this is hardly noticeable against the background of the stability margin used in modern ciphers. The result of this generalization is a scientific statement that can be described as follows: random S-boxes can be used in all known modern ciphers without reducing stability. That is, the task of finding S-boxes with special properties loses any meaning, which means that the scientific direction related to the search for S-boxes with special properties becomes redundant.
- 29 September 2023
- Published by National Aerospace University - Kharkiv Aviation Institute in RADIOELECTRONIC AND COMPUTER SYSTEMS
- No. 3,p. 150-158
Open AccessThe influence of S-boxes on the arrival of the cipher to the state of random substitution
The subject of this study is the process of developing block symmetric ciphers with improved cryptographic stability indicators for solving the problems of information protection in information and communication systems. The goal of this study is to develop a mathematical model of the optimal s-box design (non-linear substitution block) for modern block symmetric ciphers. Task: to show that the stability of block symmetric ciphers does not significantly depend on the indicators of the s-boxes included in these ciphers; to justify their use without reducing the stability of random substitutions as s-box constructions of modern block symmetric ciphers; and to prove the futility of searching for s-boxes with special properties. The methods used are: methods of probability theory; mathematical statistics; combinatorics and system analysis; methods of statistical tests; and methods of Boolean algebra. The following results were obtained. In modern ciphers, nonlinear substitution transformations are used as S-boxes (in most ciphers, byte substitutions are used). S-boxes perform the main function of encryption transformation - mixing of text bits. Dynamic indicators of the arrival of the cipher in the state of random substitution depend on their effectiveness. The presented results confirm that the indicators of cipher stability do not significantly depend on the indicators of the S-boxes included in the ciphers. It is not the individual properties of substitutions, but the results of their sequential interactions decisive for achieving stability indicators. It is shown that the fee for encryption is chosen to be three to four times greater than the depth of the avalanche effect - the minimum number of cycles of the cipher’s arrival to the state of random substitution) is hardly noticeable. Conclusions. The scientific novelty of the obtained results is as follows. This work represents a generalization of the transition to the use of random permutations as S-boxes is an increase of only one cycle in the number of cycles of the arrival of the cipher to the state of random permutations, and this is hardly noticeable against the background of the stability margin used in modern ciphers. The result of this generalization is a scientific statement that can be described as follows: random S-boxes can be used in all known modern ciphers without reducing stability. That is, the task of finding S-boxes with special properties loses any meaning, which means that the scientific direction related to the search for S-boxes with special properties becomes redundant.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 391-395
Block cipher with improved dynamic indicators of the condition of a random substitution
On the example of the improved cipher of Kalina-2, SPN ciphers with improved indicators of their transition to the state of random substitution is offering. The improvement is basing on the application of the first cycle transformation of the new design, which allows activating all S-blocks of the second cycle. Ciphers are not inferior to the speed of known structures and allow without reducing the stability to use in them random S-blocks.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 391-395
Block cipher with improved dynamic indicators of the condition of a random substitution
On the example of the improved cipher of Kalina-2, SPN ciphers with improved indicators of their transition to the state of random substitution is offering. The improvement is basing on the application of the first cycle transformation of the new design, which allows activating all S-blocks of the second cycle. Ciphers are not inferior to the speed of known structures and allow without reducing the stability to use in them random S-blocks.