Sciweavers

210 search results - page 31 / 42
» Widening Integer Arithmetic
Sort
View
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran
SIAMDM
2010
84views more  SIAMDM 2010»
13 years 5 months ago
Complementary Iterated Floor Words and the Flora Game
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
Aviezri S. Fraenkel
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
12 years 11 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
EUROCRYPT
2011
Springer
12 years 11 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
14 years 4 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...