Serhii Yakovliev

Serhii Yakovliev

Auto-generated profile, based on publicly available information

Serhii Yakovliev

National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
28 May 2016 in Cybernetics and Systems Analysis
Verified
Journal Article
Closed access
PDF file
AAA. N. Alekseychuk
A. N. Alekseychuk
Lyudmila V KovalchukLyudmila V Kovalchuk
Lyudmila V Kovalchuk
ASA. S. Shevtsov
A. S. Shevtsov
SYS. V. Yakovliev
S. V. Yakovliev

7 April 2025 in International Journal of Electronics and Telecommunications
Verified
Journal Article
Open access
PDF file
SYSerhii Yakovliev
Serhii Yakovliev
In this work, we consider a class of mappings over bit vectors which imitate the multiplication by small constants with pure logic operations and non-cyclic shifts. Such mappings can provide non-linearity and strengthen the design of LRXcryptosystems, which are widely used in lightweight cryptography, due to their apparent benefits: a simple implementation and the absence of internal rotational symmetry, which increases security against rotational attacks. We examine the security of these mappings against differential cryptanalysis. We provide an explicit easy-to-calculate expression of differential probabilities for several versions of LRX-analogues of small constant multiplication with different operations and shift values.

29 May 2019 in Theoretical and Applied Cybersecurity
Verified
Journal Article
Open access
PDF file
SYSerhii Yakovliev
Serhii Yakovliev
VBVsevolod Bakhtigozin
Vsevolod Bakhtigozin
Asymptotic Distributions for S-Box Heterogeneous Differential Probabilities

1 November 2024 in Tatra Mountains Mathematical Publications
Verified
Journal Article
Open access
PDF file
OYOleksii Yakymchuk
Oleksii Yakymchuk
SYSerhii Yakovliev
Serhii Yakovliev
We propose a formalized approach to truncated differential cryptanalysis based on ternary masks that separately account for unchanged, obligatorily changed, and unknown bits in differences. We introduce a security parameter for S-boxes and encryption mappings, which bounds the probability of truncated differentials from below, and examine its basic algebraic properties. Our approach enables the adaptation of existing techniques used in classical differential attacks to truncated differential cryptanalysis, allowing us to extract more information from the encryption process and evaluate the complexity of truncated differential attacks.

1 January 2024 in Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics
Verified
Journal Article
Open access
PDF file
NINational Technical University of Ukraine "Igor Sikorsky Kiev Polytechnic Institute"
National Technical University of Ukraine "Igor Sikorsky Kiev Polytechnic Institute"
LZLyudmyla Zavadska
Lyudmyla Zavadska
VMVolodymyr Morenets
Volodymyr Morenets
IRIrina Rozora
Irina Rozora
DSDmytro Savchuk
Dmytro Savchuk
SYSerhii Yakovlev
Serhii Yakovlev
Dedicated to the memory of the outstanding Ukrainian scientist, corresponding member of the NAS of Ukraine, laureate of the State Prize in Science and Technology, professor of the National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute" Mykhailo Mykolayovych Savchuk. The article analyzes the scientific achievements of the scientist, and his significant contribution to the development of national science, in particular in the field of cryptography. A list of key scientific works and awards received is also provided.

17 November 2025 in Theoretical and Applied Cybersecurity
Verified
Journal Article
Open access
PDF file
SYStepan Yershov
Stepan Yershov
SYSerhii Yakovliev
Serhii Yakovliev
This paper considers the problem of S-box recovery from its differential distribution table (DDT) with respect to modular addition. We describe the structure of DDT for affine S-boxes and affine transformations of S-boxes. We found some unexpected internal symmetry in DDT w.r.t. modular addition, which holds for other algebraic operations, but not for bitwise addition (XOR). We describe two classes of affine transformations (affine shifts) which preserve the structure of DDT. For a recovery of S-box from its DDT we propose a backtracking-based algorithm, which is moderately effective for medium-size S-boxes. We apply our algorithm for three-bit S-boxes and describe the structure of their DDT equivalence classes; among other things, it was shown that affine shifts do not cover all DDT equivalence class members.