471 search results - page 1 / 95 » Faster Multiplication in GF(2)[x] |
ANTS
2008
Springer
14 years 28 days ago
2008
Springer
![Faster Multiplication in GF(2)[x]](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Faster Multiplication in GF(2)[x]")
Abstract. In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba's, Toom-Cook...
PKC
2004
Springer
14 years 4 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
ICDT
2009
ACM
14 years 11 months ago
2009
ACM
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...
IPPS
2008
IEEE
14 years 5 months ago
2008
IEEE
Recently a GPU has acquired programmability to perform general purpose computation fast by running ten thousands of threads concurrently. This paper presents a new algorithm for d...
RSA
2002
13 years 10 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...