Výsledky vyhľadávania - Modulo multiplication algorithm

Tolerance to asynchrony in algorithms for multiplication and modulo Autor Gupta, Arya Tanmay, Kulkarni, Sandeep S

“…In this article, we study some parallel processing algorithms for multiplication and modulo operations…”
Získať plný text

The specifics of the Galois field GF(257) and its use for digital signal processing Autor Bakirov, Akhat, Matrassulova, Dinara, Vitulyova, Yelizaveta, Shaltykova, Dina, Suleimenov, Ibragim

“…An algorithm of digital logarithm calculation for the Galois field G F ( 257 ) is proposed. It is shown that this field is coupled with one of the most…”
Získať plný text

Algorithm for modulo (2 n +1) multiplication Autor Sousa, L.A.

Získať plný text

Features of digital signal processing algorithms using Galois fields GF(2n+1) Autor Suleimenov, Ibragim E., Vitulyova, Yelizaveta S., Matrassulova, Dinara K.

“… For such numbers, it is possible to implement a multiplication algorithm modulo p, similar to the multiplication algorithm modulo the Mersenne number…”
Získať plný text

Signed sliding window algorithms for modulo multiplication Autor Phillips, B.J., Burgess, N.

“…The signed sliding window (SSW) number system for accelerating long-wordlength modulo multiplication is introduced…”
Získať plný text

Modulo M multiplication-addition: algorithms and FPGA implementation Autor Beuchat, J.-L., Muller, J.-M.

Získať plný text

Signed sliding window algorithms for modulo multiplication Autor Phillips, B J, Burgess, N

“…The signed sliding window (SSW) number system for accelerating long-wordlength modulo multiplication is introduced…”
Získať plný text

Tolerance to Asynchrony in Algorithms for Multiplication and Modulo Autor Gupta, Arya Tanmay, Kulkarni, Sandeep S

“…In this article, we study some parallel processing algorithms for multiplication and modulo operations…”
Získať plný text

Modulo M multiplication-addition: algorithms and FPGA implementation Autor Beuchat, J-L, Muller, J-M

“…Variants of a modular multiplication algorithm originally due to Koc and Hung, that are especially suited for FPGA implementation, and that allow to compute (XY+W…”
Získať plný text

A fast modular multiplication algorithm for calculating the product AB modulo N Autor CHEN, C.-Y, CHANG, C.-C

“…A fast modular multiplication algorithm for calculating the product AB modulo N is examined…”
Získať plný text

A theta (log n) algorithm for modulo multiplication Autor Elleithy, K.M., Bayoumi, M.A.

“…A theta (log n) algorithm for large moduli multiplication for residue-number-system (RNS…”
Získať plný text

A fast modular multiplication algorithm for calculating the product [formula omitted] modulo [formula omitted] Autor Chen, Chien-Yuan, Chang, Chin-Chen

“…In this paper, we propose a fast iterative modular multiplication algorithm for calculating the product AB modulo N, where N is a large modulus in number-theoretic cryptosystems, such as RSA cryptosystems…”
Získať plný text

Modify Linear Congruent Generator Algorithms Using Inverse Elements of Modulo Multiplication for Randomizing Exams Autor Sujono, Maxrizal, Irawadi, Syafrul, Prayanti, Baiq Desy Aniska

“… In this study, we propose a modification of LCG by adding an inverse element to the multiplication mod m…”
Získať plný text

Algorithm for modulo (2 sub( n)+1) multiplication Autor Sousa, L A

“…An algorithm for designing an efficient modulo (2n+1) multipliers based on Booth recoding is proposed…”
Získať plný text

Algorithm for modulo (2^sub n^+1) multiplication Autor Sousa, L A

“…An algorithm for designing an efficient modulo (2n+1) multipliers based on Booth recoding is proposed…”
Získať plný text

Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC Autor Ali, Shoukat, Cenk, Murat

“…We present faster algorithms for the residue multiplication modulo 521-bit Mersenne prime on 32- and 64-bit platforms by using Toeplitz matrix-vector product…”
Získať plný text

An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial Autor Kaminski, Michael, Chaoping Xing

“… over \BBF q 2 have places of all degrees and apply a Chudnovsky like algorithm for multiplication of polynomials modulo a power of an irreducible polynomial…”
Získať plný text

C2CU: a CUDA C program generator for bulk execution of a sequential algorithm Autor Takafuji, Daisuke, Nakano, Koji, Ito, Yasuaki, Bordim, Jacir

“…Summary Several important tasks, including matrix computation, signal processing, sorting, dynamic programming, encryption, and decryption, can be performed by oblivious sequential algorithms…”
Získať plný text

An algorithm for multiplication modulo (2/spl and/N-1) Autor Zhongde Wang, Jullien, G.A., Miller, W.C.

“…This paper proposes an efficient algorithm for multiplication modulo (2/sup N/-1). To achieve high speed, the Wallace tree is adopted for the multiplier…”
Získať plný text

A Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two Autor Andreica, Mugurel Ionut

“…I present a new algorithm for computing binomial coefficients modulo 2N. The proposed method has an O(N3·Multiplication(N)+N4…”
Získať plný text