Arithmetic plays a major role in a computer? s performance and efficiency. Building new
computing platforms supported by the traditional binary arithmetic and silicon-based …

In this paper a design of the polynomial multiplier by modulo of irreducible polynomial with
coeffi‐cients in GF (2) is described. The main advantages of using the non-positional …

Modern algorithms for symmetric and asymmetric encryptions are not suitable to provide
security of data that needs data processing. They cannot perform calculations over …

Residue number systems (RNSs) are efficient alternatives to positional number systems,
providing fast and power-efficient computational systems. The key feature of the RNS …

With the explosion of neural network applications and the linked need to perform an
enormous amount of mathematical operations, traditional computing systems faced …

This paper presents theoretical backgrounds of the symmetric encryption based on the
residue number system. The peculiarities of this approach are that in the case of restoring a …

The mathematical theory of Residue Number System (RNS) arithmetic existed in the
mathematical literature for thousands of years, having first been published by Sun Tzu in …

Inter-modulo operations are the most time consuming and costly operations of the residue
number system (RNS), and one of the main obstacles to applying RNS in practice to the …

The residue number system (RNS) is a non-positional number system that allows one to
perform addition and multiplication operations fast and in parallel. However, because the …

This paper presents a comprehensive knowledge mapping and in-depth analysis of the
application of residue number system in encryption technique research to understand better …