251 search results - page 11 / 51 » On Modular Decomposition of Integers |
SIAMJO
2010
14 years 4 months ago
2010
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
IPPS
1999
IEEE
15 years 1 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...
MKM
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Recent work has detailed the conditions under which univariate Laurent polynomials have functional decompositions. This paper presents algorithms to compute such univaria...
ISCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
— We propose a fast Modular Arithmetic Logic Unit (MALU) that is scalable in the digit size (d) and the field size (k). The datapath of MALU has chains of Carry Save Adders (CSA...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...