Search for Articles:

MECS Press Menu

Onai Mykola

Work place: Faculty of Applied Mathematics, National Technical University of Ukraine "Kyiv Polytechnic Institute", Ukraine

E-mail:

Website:

Research Interests: Computer systems and computational processes, Computer Architecture and Organization, Hardware Security, Network Architecture, Network Security, Data Structures and Algorithms

Biography

Onai Mykola was born in Pruzhany, Bilorus on December 06, 1986. He graduated from Zaporizhzhia City Gymnasium 28 in Zaporizhzhia in June 2004. He received his Bachelor’s degree in Computer Engineering (June 2008) and his M.S. degree in Computer Systems and Networks (June 2010), both from the Department of Special Purpose Computer Systems at National Technical University of Ukraine "Kyiv Polytechnic Institute", Kyiv, Ukraine. He is currently a Senior Lecturer in the Computer Systems Software Department at National Technical University of Ukraine "Kyiv Polytechnic Institute", Kyiv, Ukraine and working toward a PhD degree in Computer Components at the same university. His main research interests are finite field arithmetic, public key cryptography, elliptic curve cryptography (hardware and software implementations), computer security, network security and hardware algorithms for cryptography. Onai Mykola has authored and co-authored more than 30 scientific publications, and is inventor of four patents.

Author Articles
The Analysis and Investigation of Multiplicative Inverse Searching Methods in the Ring of Integers Modulo M

By Zhengbing Hu I. A. Dychka Onai Mykola Bartkoviak Andrii

DOI: https://doi.org/10.5815/ijisa.2016.11.02, Pub. Date: 8 Nov. 2016

In this article an investigation into search operations for the multiplicative inverse in the ring of integers modulo m for Error Control Coding tasks and for data security is shown. The classification of the searching operation of the multiplicative inverse in the ring of integers modulo m is provided. The best values of parameters for Joye-Paillier method and Lehmer algorithm were also found. The improved Bradley modification for the extended Euclidean algorithm is also offered, which gives the operating speed improvement for 10-15%. The integrated experimental research of basic classes of searching methods for multiplicative inverse in the ring of integers modulo m is conducted for the first time and the analytical formulas for these calculations of random access memory necessary space when operated at k-ary RS-algorithms and their modifications are shown.

[...] Read more.
Other Articles

Subscribe to receive issue release notifications and newsletters from MECS Press journals