Polynomials Multiplier under Irreducible Polynomial Module for High-Performance Cryptographic Hardware Tools
Maksat Kalimoldayev, Sahibay Tynymbayev, Miras Magzom, Margulan Ibraimov, Serik A. Khokhlov, Akmaral Abisheva, Viktoriia Sydorenko · 2019
One of the most popular and effective methods of information security is cryptographic, that can be realized in software as well as in hardware tools. Hardware cryptographic devices are oriented on confidentiality ensuring put some actual problems must be solved. For the purpose to raise the performance of computing devices productivity, it is necessary to use number systems without the disadvantages of the radix numeration system. This is due to the fact that while performing on multi-digit numbers arithmetic operations represented in the positional system, it becomes necessary to take into account inter-bit transfers that far slows down the computation speed and complicates the calculator structure. The new ways search to improve the computing devices performance led researchers to an objective conclusion that in this direction of the positional number system all possibilities have been exhausted. In order to boost productivity of computing devices, it is necessary to use number systems without such disadvantages.