Evgeniya Ishchukova

Dr. Evgeniya Ishchukova

ИКТИБ, Southern Federal University, Rostov-on-Don, Russia
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
20 July 2016
Verified
Conference Paper
Open access
Evgeniya IshchukovaEvgeniya Ishchukova
Evgeniya Ishchukova
LBLudmila Babenko
Ludmila Babenko
MAMaxim Anikeev
Maxim Anikeev
The new cryptographic standard GOST R 34.12-2015 "Information technology. Cryptographic Data Security. Block ciphers." [7] came into force on January 1st, 2016. The standard contains two encryption algorithms. One of those is a former standard encryption algorithm GOST 29147-89 (also known as simply GOST) with fixed S-boxes. This algorithm is denoted as Magma in the new standard. The second algorithm is a new symmetric block cipher based on SP-network, which is denoted as Kuznyechik (also transliterated as "Kuznechik"). Nowadays, a lot of attention is paid to the issues of quality of the new cipher, namely its cryptographic strength, performance, portability, implementation, etc. In this paper we are offering to consider the possibility to use parallel computations based on MPI and NVIDIA CUDA technologies for cryptanalysis of Magma and Kuznyechik. We choose slide attack for the implementation. The slide attack is applicable to Magma and Kuznyechik ciphers only with significant weakening modifications to their original descriptions. However, research on applicability of parallel implementation of cryptanalysis is important, because the parallel approach can be applied to other more efficient methods of cryptanalysis. The proposed parallel algorithms implemented for two different technologies demonstrate close to linear growth of analysis speed with the increase of involved processor cores. Also we propose a fast implementation of Kuznyechik data encryption based on precomputed tables.

28 May 2020 in Computation
Verified
Journal Article
Open access
PDF file
Evgeniya IshchukovaEvgeniya Ishchukova
Evgeniya Ishchukova
EMEkaterina Maro
Ekaterina Maro
PPPavel Pristalov
Pavel Pristalov
In January 2016, a new standard for symmetric block encryption was established in the Russian Federation. The standard contains two encryption algorithms: Magma and Kuznyechik. In this paper we propose to consider the possibility of applying the algebraic analysis method to these ciphers. To do this, we use the simplified algorithms Magma ⊕ and S-KN2. To solve sets of nonlinear Boolean equations, we choose two different approaches: a reduction and solving of the Boolean satisfiability problem (by using the CryptoMiniSat solver) and an extended linearization method (XL). In our research, we suggest using a security assessment approach that identifies the resistance of block ciphers to algebraic cryptanalysis. The algebraic analysis of an eight-round Magma (68 key bits were fixed) with the CryptoMiniSat solver demanded four known text pairs and took 3029.56 s to complete (the search took 416.31 s). The algebraic analysis of a five-round Magma cipher with weakened S-boxes required seven known text pairs and took 1135.61 s (the search took 3.36 s). The algebraic analysis of a five-round Magma cipher with disabled S-blocks (equivalent value substitution) led to getting only one solution for five known text pairs in 501.18 s (the search took 4.92 s). The complexity of the XL algebraic analysis of a four-round S-KN2 cipher with three text pairs was 236.33 s (took 1.191 Gb RAM).

10 February 2023 in Sensors
Verified
Journal Article
Open access
PDF file
EBElena Basan
Elena Basan
ABAlexandr Basan
Alexandr Basan
Alexey NekrasovAlexey Nekrasov
Alexey Nekrasov
CFColin Fidge
Colin Fidge
Evgeniya IshchukovaEvgeniya Ishchukova
Evgeniya Ishchukova
ALAlexandr Lesnikov
Alexandr Lesnikov
We consider the trusted operation of cyber-physical processes based on an assessment of the system’s state and operating mode and present a method for detecting anomalies in the behavior of a cyber-physical system (CPS) based on the analysis of the data transmitted by its sensory subsystem. Probability theory and mathematical statistics are used to process and normalize the data in order to determine whether or not the system is in the correct operating mode and control process state. To describe the mode-specific control processes of a CPS, the paradigm of using cyber-physical parameters is taken as a basis, as it is the feature that most clearly reflects the system’s interaction with physical processes. In this study, two metrics were taken as a sign of an anomaly: the probability of falling into the sensor values’ confidence interval and parameter change monitoring. These two metrics, as well as the current mode evaluation, produce a final probability function for our trust in the CPS’s currently executing control process, which is, in turn, determined by the operating mode of the system. Based on the results of this trust assessment, it is possible to draw a conclusion about the processing state in which the system is operating. If the score is higher than 0.6, it means the system is in a trusted state. If the score is equal to 0.6, it means the system is in an uncertain state. If the trust score tends towards zero, then the system can be interpreted as unstable or under stress due to a system failure or deliberate attack. Through a case study using cyber-attack data for an unmanned aerial vehicle (UAV), it was found that the method works well. When we were evaluating the normal flight mode, there were no false positive anomaly estimates. When we were evaluating the UAV’s state during an attack, a deviation and an untrusted state were detected. This method can be used to implement software solutions aimed at detecting system faults and cyber-attacks, and thus make decisions about the presence of malfunctions in the operation of a CPS, thereby minimizing the amount of knowledge and initial data about the system.

5 August 2025 in Sci
Verified
Journal Article
Open access
PDF file
Evgeniya IshchukovaEvgeniya Ishchukova
Evgeniya Ishchukova
Sergei PetrenkoSergei Petrenko
Sergei Petrenko
APAlexey S. Petrenko
Alexey S. Petrenko
Konstantin GnidkoKonstantin Gnidko
Konstantin Gnidko
Alexey NekrasovAlexey Nekrasov
Alexey Nekrasov
Today, blockchain technologies are a separate, rapidly developing area. With rapid development, they open up a number of scientific problems. One of these problems is the problem of reliability, which is primarily associated with the use of cryptographic primitives. The threat of the emergence of quantum computers is now widely discussed, in connection with which the direction of post-quantum cryptography is actively developing. Nevertheless, the most popular blockchain platforms (such as Bitcoin and Ethereum) use asymmetric cryptography based on elliptic curves. Here, cryptographic primitives for blockchain systems are divided into four groups according to their functionality: keyless, single-key, dual-key, and hybrid. The main attention in the work is paid to the most significant cryptographic primitives for blockchain systems: keyless and single-key. This manuscript discusses possible scenarios in which, during practical implementation, the mathematical foundations embedded in the algorithms for generating a digital signature and encrypting data using algorithms based on elliptic curves are violated. In this case, vulnerabilities arise that can lead to the compromise of a private key or a substitution of a digital signature. We consider cases of vulnerabilities in a blockchain system due to incorrect use of a cryptographic primitive, describe the problem, formulate the problem statement, and assess its complexity for each case. For each case, strict calculations of the maximum computational costs are given when the conditions of the case under consideration are met. Among other things, we present a new version of the encryption algorithm for data stored in blockchain systems or transmitted between blockchain systems using elliptic curves. This algorithm is not the main blockchain algorithm and is not included in the core of modern blockchain systems. This algorithm allows the use of the same keys that system users have in order to store sensitive user data in an open blockchain database in encrypted form. At the same time, possible vulnerabilities that may arise from incorrect implementation of this algorithm are considered. The scenarios formulated in the article can be used to test the reliability of both newly created blockchain platforms and to study long-existing ones.

17 June 2026 in Technologies
Verified
Journal Article
Open access
PDF file
Evgeniya IshchukovaEvgeniya Ishchukova
Evgeniya Ishchukova
FSFaezeh Sadat Sajadi
Faezeh Sadat Sajadi
Sergei PetrenkoSergei Petrenko
Sergei Petrenko
APAlexey S. Petrenko
Alexey S. Petrenko
Alexey NekrasovAlexey Nekrasov
Alexey Nekrasov
We performed a cross-layer, system-level analysis of the post-quantum transition of blockchain architectures through a systematic review. The analysis, based on 108 peer-reviewed studies, moves beyond post-quantum cryptography (PQC) as merely a primitive substitution and examines how quantum pressures cascade through validation, propagation, interoperability, governance, and regulatory layers. Empirical results show that the authenticated payloads for lattice signatures grow from ~65–73 bytes (ECDSA) up to kilobyte-scale sizes, and verification overhead is increased by a factor of 2× to 5× depending on the deployment scenario. Such inflation can narrow block-capacity margins, increase propagation delay under fixed-interval regimes, and shift validator resource thresholds in heterogeneous networks. Moreover, the harvest-now–decrypt-later model creates a temporal asymmetry between the design options and the exposure window. These findings indicate that post-quantum resilience depends more on maintaining a structural balance among the tightly coupled technical and institutional stress channels than on the strength of the algorithm itself, and migration success ultimately depends on the ability to coordinate the management of these constraints, rather than on managing them separately.

1 January 2013
Verified
Book Chapter
Closed access
LBLudmila Babenko
Ludmila Babenko
Evgeniya IshchukovaEvgeniya Ishchukova
Evgeniya Ishchukova
EMEkaterina Maro
Ekaterina Maro
This chapter considers approaches to analysis of the GOST 28147-89 encryption algorithm (also known as simply GOST), which is the basis of most secure information systems in the Russian Federation. As soon as the GOST algorithm is characterized by a simple structure and uses widely known mathematical operations, approaches to its analysis can be easily propagated to other cryptographic systems. In the conclusion, the authors consider some interesting observations that are related to the structure of GOST encryption and can be useful for further development of cryptanalysis.