Oleh Horyachyy

Mr. Oleh Horyachyy

Lviv Polytechnic National University, Lviv, Ukraine
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
17 February 2021 in Computation
Verified
Journal Article
Open access
PDF file
LMLeonid Moroz
Leonid Moroz
Volodymyr SamotyyVolodymyr Samotyy
Volodymyr Samotyy
Oleh HoryachyyOleh Horyachyy
Oleh Horyachyy
Many low-cost platforms that support floating-point arithmetic, such as microcontrollers and field-programmable gate arrays, do not include fast hardware or software methods for calculating the square root and/or reciprocal square root. Typically, such functions are implemented using direct lookup tables or polynomial approximations, with a subsequent application of the Newton–Raphson method. Other, more complex solutions include high-radix digit-recurrence and bipartite or multipartite table-based methods. In contrast, this article proposes a simple modification of the fast inverse square root method that has high accuracy and relatively low latency. Algorithms are given in C/C++ for single- and double-precision numbers in the IEEE 754 format for both square root and reciprocal square root functions. These are based on the switching of magic constants in the initial approximation, depending on the input interval of the normalized floating-point numbers, in order to minimize the maximum relative error on each subinterval after the first iteration—giving 13 correct bits of the result. Our experimental results show that the proposed algorithms provide a fairly good trade-off between accuracy and latency after two iterations for numbers of type float, and after three iterations for numbers of type double when using fused multiply–add instructions—giving almost complete accuracy.

1 September 2019
Verified
Conference Paper
Closed access
LMLeonid Moroz
Leonid Moroz
VSVolodymyr Samotyy
Volodymyr Samotyy
Oleh HoryachyyOleh Horyachyy
Oleh Horyachyy
UDUlyana Dzelendzyak
Ulyana Dzelendzyak

31 December 2019 in International Journal of Computing
Verified
Journal Article
Open access
PDF file
Oleh HoryachyyOleh Horyachyy
Oleh Horyachyy
LMLeonid Moroz
Leonid Moroz
VOViktor Otenko
Viktor Otenko
The purpose of this paper is to introduce a modification of Fast Inverse Square Root (FISR) approximation algorithm with reduced relative errors. The original algorithm uses a magic constant trick with input floating-point number to obtain a clever initial approximation and then utilizes the classical iterative Newton-Raphson formula. It was first used in the computer game Quake III Arena, causing widespread discussion among scientists and programmers, and now it can be frequently found in many scientific applications, although it has some drawbacks. The proposed algorithm has such parameters of the modified inverse square root algorithm that minimize the relative error and includes two magic constants in order to avoid one floating-point multiplication. In addition, we use the fused multiply-add function and iterative methods of higher order in the second iteration to improve the accuracy. Such algorithms do not require storage of large tables for initial approximation and can be effectively used on field-programmable gate arrays (FPGAs) and other platforms without hardware support for this function.

1 September 2018
Verified
Conference Paper
Closed access
LMLeonid Moroz
Leonid Moroz
VSVolodymyr Samotyy
Volodymyr Samotyy
Oleh HoryachyyOleh Horyachyy
Oleh Horyachyy
This paper describes a simple and accurate floating-point reciprocal algorithm based on two modified Newton-Raphson iterations with a magic constant as the initial approximation. It can be effectively implemented on platforms with no FPU support since it uses just addition., multiplication and fused multiply-add operations.

26 June 2025 in Cybersecurity: Education, Science, Technique
Verified
Journal Article
Open access
PDF file
MMMykhailo Markevych
Mykhailo Markevych
Oleh HoryachyyOleh Horyachyy
Oleh Horyachyy
The current state of information technology development is characterized by the widespread use of databases in various fields of activity, in particular, in business, medicine, science and public administration. The growth of data volumes and their value leads to an increase in the number of cyberattacks on databases. In this regard, the issue of ensuring database security is becoming particularly relevant. The article considers the effectiveness of server attacks on relational and non-relational databases. A detailed analysis of attack methods, such as SQL/NoSQL injections and dictionary attacks, is carried out, and their consequences for the security of information systems are assessed. The effectiveness of password brute-force cracking is analyzed depending on the parameters of hash functions and the number of hashing rounds of the bcrypt library. It is shown that with an increase in the number of hashing rounds, the computational stability of password selection increases, so each attempt takes more time to process. However, even with a limited dictionary and an effective brute-force method, the attack can be performed in a fairly short period of time if the hashing parameters are chosen incorrectly. Schematic drawings of attacks on the corresponding types of databases are presented. A comprehensive protection strategy is proposed to ensure the confidentiality, integrity and availability of information, which includes pre-processing of user data, hashing of passwords, setting limits on the number of requests, delimiting access and blocking of computerized actions. Methods for countering server attacks are described and implemented, in particular, functional libraries for the secure storage of user passwords are considered. In addition, a comparison of the effectiveness of different types of attacks in the context of existing protection methods is carried out. The results of the study demonstrated that the comprehensive implementation of the basic components of the protection strategy significantly increases the resistance of data to typical server attacks, especially in a scalable environment with a large number of entry points.