4 search results - page 1 / 1 » Montgomery Reduction Algorithm for Modular Multiplication Us... |
81
Voted
ARITH
2007
IEEE
15 years 9 months ago
2007
IEEE
120
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
149
Voted
ITCC
2005
IEEE
15 years 8 months 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...
137
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...