Search Results - Modulo multiplication algorithm

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

“…In this article, we study some parallel processing algorithms for multiplication and modulo operations…”
Get full text

The specifics of the Galois field GF(257) and its use for digital signal processing by 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…”
Get full text

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

Get full text

Features of digital signal processing algorithms using Galois fields GF(2n+1) by 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…”
Get full text

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

“…The signed sliding window (SSW) number system for accelerating long-wordlength modulo multiplication is introduced…”
Get full text

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

Get full text

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

“…The signed sliding window (SSW) number system for accelerating long-wordlength modulo multiplication is introduced…”
Get full text

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

“…In this article, we study some parallel processing algorithms for multiplication and modulo operations…”
Get full text

Modulo M multiplication-addition: algorithms and FPGA implementation by 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…”
Get full text

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

“…A fast modular multiplication algorithm for calculating the product AB modulo N is examined…”
Get full text

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

“…A theta (log n) algorithm for large moduli multiplication for residue-number-system (RNS…”
Get full text

A fast modular multiplication algorithm for calculating the product [formula omitted] modulo [formula omitted] by 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…”
Get full text

Modify Linear Congruent Generator Algorithms Using Inverse Elements of Modulo Multiplication for Randomizing Exams by 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…”
Get full text

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

“…An algorithm for designing an efficient modulo (2n+1) multipliers based on Booth recoding is proposed…”
Get full text

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

“…An algorithm for designing an efficient modulo (2n+1) multipliers based on Booth recoding is proposed…”
Get full text

Faster Residue Multiplication Modulo 521-bit Mersenne Prime and an Application to ECC by 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…”
Get full text

An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial by 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…”
Get full text

C2CU: a CUDA C program generator for bulk execution of a sequential algorithm by 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…”
Get full text

An algorithm for multiplication modulo (2/spl and/N-1) by 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…”
Get full text

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

“…I present a new algorithm for computing binomial coefficients modulo 2N. The proposed method has an O(N3·Multiplication(N)+N4…”
Get full text