128 search results - page 8 / 26 » Fast Integer Multiplication using Modular Arithmetic |
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
FDTC
2006
Springer
13 years 11 months ago
2006
Springer
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
GLVLSI
2011
IEEE
12 years 11 months ago
2011
IEEE
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
CHES
2005
Springer
14 years 27 days ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...