471 search results - page 8 / 95 » Faster Multiplication in GF(2)[x] |
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Abstract—Fast multiplication can be achieved by using canonical signed digit (CSD) to speed-up computations. Conversion to CSD is needed when the multiplier is not known a priori...
DCC
2006
IEEE
14 years 9 months ago
2006
IEEE
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
ARITH
1999
IEEE
14 years 2 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...
IALP
2010
13 years 7 months ago
2010
Inflection and derivation have been the main ways of creating new words in English. With the development of science and technology, words as such appear faster than ever in scient...