The paper reviews technologies of computer systems the development of which has led to the emergence of cyber-physical systems - there are embedded computer systems, open systems interconnection model, multilayer computer systems, wireless communications, microelectromechanical systems, data protection technologies. It is noted that there are computer systems exist, whose parameters are close to those of cyber-physical systems ones, there are also groups of developers who have experience of in such systems designing. The satellite scientific data collection and accumulation system developed in Lviv Center of Institute for Space Research of NAS and SSA of Ukraine with the participation of Lviv Polytechnic National University Computers department is an example of such systems. In paper The main features of this system are described in the paper. The recommendations are given onf using it as the basis for the creation of advanced cyber-physical systems.

Currently, elliptic curves are the mathematical basis for digital signature processing. Elliptic curve points processing is based on the performance of operations in Galois field GF(2m) in normal or polynomial bases. Characteristics of multipliers for these bases are different. In this paper, the time complexity of software multipliers for binary Galois fields GF(2m) and fields GF(dn) was investigated. Fields with approximately the same number of elements were investigated. Elements of these fields were represented in a polynomial basis. It is established that the Galois field GF(3т) provides the greatest time complexity of software multiplication, and the prime Galois field GF(P) has the least time complexity. It is also shown that the use of polynomial basis allows, in contrast to the normal basis, to realize larger part of multiplier on FPGA chip.

Індекс рубрикатора НБУВ: З973-048

Рубрики:

Комп'ютери та програмування

Шифр НБУВ: Ж44120 Пошук видання у каталогах НБУВ 

In this paper, the digital quantum coprocessor has been checked for the possibility of quantum Fourier transform, which is the main quantum operation of the Shor's algorithm. To do this, the model of the 4-qubit coprocessor has been created, its work has been simulated and it has been implemented in FPGA.

Індекс рубрикатора НБУВ: З973-048

Рубрики:

Комп'ютери та програмування

Шифр НБУВ: Ж44120 Пошук видання у каталогах НБУВ 

In this paper, the digital quantum coprocessor has been checked for the possibility of quantum Fourier transform, which is the main quantum operation of the Shor's algorithm. To do this, the model of the 4-qubit coprocessor has been created, its work has been simulated and it has been implemented in FPGA.

Abstract: The information security is playing an increasingly important role nowadays. Therefore, virus can be transmitted through the information in encrypted form. This is also applied to embedded systems. In this regard, the article is assigned to the topic of cryptocurrency protection in embedded systems using the national Ukrainian standard Kalyna. To further explore the topic, this algorithm was implemented on a microcontroller to test the performance, convenience and prospects for usage in embedded systems.

The information security is playing an increasingly important role nowadays. Therefore, virus can be transmitted through the information in encrypted form. This is also applied to embedded systems. In this regard, the article is assigned to the topic of cryptocurrency protection in embedded systems. The article is focused on the algorithm of symmetric block transformation "Kalyna". The algorithm has been developed in cooperation with the State Special Communications Service and leading Ukrainian scientists. The experience and results of international and open national competition of cryptographic algorithms have been taken into account. The algorithm is intended for gradual replacement of the interstate standard DSTU GOST 28147:2009. Its differences from other data encryption standards used, both in Ukraine and in the world, have been analyzed. The stability of the "Kalyna" algorithm has been also analyzed using a high-bit key (512 bits) and its speed has been compared with other cryptographic protection algorithms.