Add to ORKGIn this paper, research in the field of modular computing structures defined on sets of Gaussians are presented. The basis of the qualitatively new technique for the organization of high-speed parallel computations in a complex plane is presented by quadratic minimum redundant modular number systems (QMRMNS)
[[abstract]]This paper introduces a new operation for modular exponentiation opera- tions. The numbe...
© Springer-Verlag Berlin Heidelberg 1994. Three modular reduction algorithms for large integers are ...
International audienceThe modular exponentiation on large numbers is computationally intensive. An e...
In this paper we present the modular computing structures (MCS) defined on the set of polynomials ov...
The present paper is a continuation of research in parallel information processing based on the tabu...
With the increased use of public key cryptography, faster modular multiplication has become an impor...
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 propose a new number representation and arithmetic for the elements of the ring of integers modul...
The Montgomery multiplication is an efficient method for modular arithmetic. Typically, it is used f...
In the present paper, we deal with the methodology of constructing modular number systems (MNS), nam...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
Modular exponentiation is a time-consuming operation widely used in cryptography. Modular multi-expo...
AbstractThe modular exponentiation operation of the current algorithms for asymmetric cryptography i...
This paper provides an introduction to algorithms for fundamental linear algebra problems on various...
[[abstract]]This paper introduces a new operation for modular exponentiation opera- tions. The numbe...
© Springer-Verlag Berlin Heidelberg 1994. Three modular reduction algorithms for large integers are ...
International audienceThe modular exponentiation on large numbers is computationally intensive. An e...
In this paper we present the modular computing structures (MCS) defined on the set of polynomials ov...
The present paper is a continuation of research in parallel information processing based on the tabu...
With the increased use of public key cryptography, faster modular multiplication has become an impor...
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 propose a new number representation and arithmetic for the elements of the ring of integers modul...
The Montgomery multiplication is an efficient method for modular arithmetic. Typically, it is used f...
In the present paper, we deal with the methodology of constructing modular number systems (MNS), nam...
International audienceThe Polynomial Modular Number System (PMNS) is an integer number system which ...
Modular exponentiation is a time-consuming operation widely used in cryptography. Modular multi-expo...
AbstractThe modular exponentiation operation of the current algorithms for asymmetric cryptography i...
This paper provides an introduction to algorithms for fundamental linear algebra problems on various...
[[abstract]]This paper introduces a new operation for modular exponentiation opera- tions. The numbe...
© Springer-Verlag Berlin Heidelberg 1994. Three modular reduction algorithms for large integers are ...
International audienceThe modular exponentiation on large numbers is computationally intensive. An e...