128 search results - page 12 / 26 » Fast Integer Multiplication using Modular Arithmetic |
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
An e cient implementations of the main building block in the RSA cryptographic scheme is achieved by mapping a bit-level systolic array for modular exponentiation onto Xilinx FPGAs...
ITCC
2005
IEEE
14 years 29 days ago
2005
IEEE
We define here the Montgomery Exponent of order s, modulo the odd integer N, by MEXP = MEXP(A, X, N, s) = AX 2−s(X−1) (mod N), and illustrate some properties and usage of thi...
ACMSE
2006
ACM
13 years 11 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
ISMVL
2008
IEEE
14 years 1 months ago
2008
IEEE
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...
SACRYPT
2004
Springer
14 years 22 days ago
2004
Springer
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...