861 search results - page 3 / 173 » Faster integer multiplication |
TC
2011
13 years 15 days ago
2011
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
ARITH
1999
IEEE
13 years 10 months ago
1999
IEEE
In modern computers, the floating point unit is the part of the processor delivering the highest computing power and getting most attention from the design team. Performance of an...
DCC
2006
IEEE
13 years 9 months ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
PLDI
1994
ACM
13 years 10 months ago
1994
ACM
Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer c...
ARITH
2007
IEEE
14 years 15 days ago
2007
IEEE
Abstract. We present efficient squaring formulae based on the Toom-Cook multiplication algorithm. The latter always requires at least one non-trivial constant division in the inte...