Перегляд за Автор "Fesenko, Andrii"
Зараз показуємо 1 - 4 з 4
Результатів на сторінці
Налаштування сортування
Документ Відкритий доступ Bit-sliced Algorithm for the 512-point Number Theoretic Transform(Igor Sikorsky Kyiv Polytechnic Institute, 2025) Kripaka, Illia; Fesenko, AndriiA method for computing the 512-digit number theoretic transform used in the Vershyna digital signature scheme, employing bitwise digit operations, is proposed. The correctness of the developed algorithm and its efficient constant-time performance have been proven. The obtained results indicate that the proposed approach is adaptive and can be applied to computations with other polynomials. This enables its easy integration into various cryptosystems to ensure protection against side-channel attacks. The proposed method does not require changes to the digital signature scheme itself, introducing modifications only to the polynomial multiplication function.Документ Відкритий доступ Construction of secure direct communication protocols in the topological quantum computing model(Igor Sikorsky Kyiv Polytechnic Institute, 2025) Fesenko, Andrii; Zatsarenko, AnastasiaThis paper presents an implementation of the six-state quantum key distribution protocol and theLM05 quantum secure direct communication protocol based on anyonic systems. We consider therepresentation of logical qubits and operations of the protocol through the manipulation of abeliananyons of the Kitaev model and non-abelian Fibonacci anyons. A comparative analysis of the anyonicimplementations with the classical photonic approach is carried out in terms of key characteristics suchas accuracy, stability, and complexity. The advantages and experimental challenges of anyonic platformsfor quantum information exchange are discussed.Документ Відкритий доступ Cryptanalysis of the «Vershyna» Digital Signature Algorithm(Igor Sikorsky Kyiv Polytechnic Institute, 2023) Lytvynenko, Yuliia; Fesenko, AndriiThe CRYSTALS-Dilithium digital signature algorithm, which was selected as the prototype of the new «Vershyna» digital signature algorithm, is analyzed in this paper. The characteristics of the National Digital Signature Standard Project and the construction of the «Vershyna» algorithm are also presented. During the analysis of the project, the predicted number of iterations that the algorithm must perform to create the correct signature was calculated. In addition, basic theoretical information about the structure of Fiat-Shamir with aborts and its security in quantum and classical models oracle models is also provided. We obtain our own results on the resistance of the «Vershyna» algorithm to the attack without the use of a message in classical and quantum oracle models. The resistance of the «Vershyna» algorithm to a key recovery attack is based on the assumption of the hardness of the MLWE problem, and the resistance to existential signature forgery is based on the assumption of the hardness of the MSIS problem. In this work, the expected level of hardness of SIS and LWE problems is calculated, to which there are reductions from MSIS and MLWE problems.Документ Відкритий доступ Quantum cryptanalysis of ciphers based on generalized Feistel and Lai-Massey schemes(Igor Sikorsky Kyiv Polytechnic Institute, 2025) Fesenko, AndriiThis paper investigates generalizations of the Lai-Massey scheme, including unified constructionscombining it with the Feistel scheme (MD GLM, UFLM, L-Feistel, and quasi-Feistel). New reductionsto the quasi-Feistel scheme are provided. Known efficient quantum attacks are analyzed, includingchosen-plaintext attacks on 3 rounds and chosen-ciphertext attacks on 4 rounds for a special case of thequasi-Feistel cipher using Simon’s algorithm. It is demonstrated that restrictions in that work led to thedegeneration of the quasi-Feistel scheme into the standard Feistel scheme, replicating known quantumattacks on the Feistel scheme. New two-round distinguishing attacks are presented for the L-Feistel andMD-1 GLM schemes, enabling round key recovery