610 search results - page 5 / 122 » Fast Modular Reduction |
ARITH
2007
IEEE
14 years 1 months ago
2007
IEEE
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
SIES
2009
IEEE
14 years 2 months ago
2009
IEEE
—The performance estimation of complex multi-processor systems-on-chip (MPSoC) in a reasonable amount of time and with a good accuracy becomes more and more challenging due to th...
ICSM
2007
IEEE
14 years 1 months ago
2007
IEEE
Bioinformaticists use the Basic Local Alignment Search Tool (BLAST) to characterize an unknown sequence by comparing it against a database of known sequences, thus detecting evolu...
TIT
2008
13 years 7 months ago
2008
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the ...