The present paper is a continuation of research in parallel information processing based on the tabular modular computing structures. We deal with the methodology of using a minimal redundant modular number system for high-speed and high-precision computation by means of modern universal multicore processors. Advantages of formal computing mode on the base of modular arithmetic are demonstrated by the example of implementation of digital signal processing procedures. The additive and additive multiplicative formal computing schemes with the obtained estimations of the cardinality of working ranges for the realization of calculations are presented in the article
AbstractThe modular exponentiation operation of the current algorithms for asymmetric cryptography i...
This paper presents a new modular multiplication algorithm that allows one to implement modular mult...
There the purpose is to improve the algorithmic and structural methods of increase of speed of arith...
In this paper, we deal with the methodology for application of the theory and methods of the tabular...
This article is a continuation of research on the modular computing structures defined on the set of...
We outline a multiprocessor architecture that uses modular arithmetic to implement numerical compu...
In this paper, research in the field of modular computing structures defined on sets of Gaussians ar...
Public-key cryptography is a mechanism for secret communication between parties who have never befor...
A contemporary computer spends a large percentage of its time executing multiplication. Although con...
The work is concerned with the power increase methods of the microprocessors. The aim of the work is...
Parallel computing systems, getting over rounding-off errors by means of the use of the multiply pre...
In this paper we present the modular computing structures (MCS) defined on the set of polynomials ov...
International audienceWe propose a new systematic approach for minimal-precisioncomputations. This a...
This chapter describes Peter L. Montgomery\u27s modular multiplication method and the various improv...
With the increased use of public key cryptography, faster modular multiplication has become an impor...
AbstractThe modular exponentiation operation of the current algorithms for asymmetric cryptography i...
This paper presents a new modular multiplication algorithm that allows one to implement modular mult...
There the purpose is to improve the algorithmic and structural methods of increase of speed of arith...
In this paper, we deal with the methodology for application of the theory and methods of the tabular...
This article is a continuation of research on the modular computing structures defined on the set of...
We outline a multiprocessor architecture that uses modular arithmetic to implement numerical compu...
In this paper, research in the field of modular computing structures defined on sets of Gaussians ar...
Public-key cryptography is a mechanism for secret communication between parties who have never befor...
A contemporary computer spends a large percentage of its time executing multiplication. Although con...
The work is concerned with the power increase methods of the microprocessors. The aim of the work is...
Parallel computing systems, getting over rounding-off errors by means of the use of the multiply pre...
In this paper we present the modular computing structures (MCS) defined on the set of polynomials ov...
International audienceWe propose a new systematic approach for minimal-precisioncomputations. This a...
This chapter describes Peter L. Montgomery\u27s modular multiplication method and the various improv...
With the increased use of public key cryptography, faster modular multiplication has become an impor...
AbstractThe modular exponentiation operation of the current algorithms for asymmetric cryptography i...
This paper presents a new modular multiplication algorithm that allows one to implement modular mult...
There the purpose is to improve the algorithmic and structural methods of increase of speed of arith...