121 search results - page 6 / 25 » Optimizing polynomials for floating-point implementation |
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
: Common sub-expression elimination (CSE) serves as a useful optimization technique in the synthesis of arithmetic datapaths described at RTL. However, CSE has a limited potential ...
136
click to vote
PAIRING
2010
Springer
14 years 8 months ago
2010
Springer
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the ...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Sampling error due to jitter, or noise in the sample times, affects the precision of analog-to-digital converters in a significant, nonlinear fashion. In this paper, a polynomial...
CTRSA
2005
Springer
15 years 3 months ago
2005
Springer
This work proposes a compact implementation of the AES S-box using composite field arithmetic in GF(((22 ) 2 ) 2 ). It describes a systematic exploration of different choices for...