43 search results - page 6 / 9 » A Fast Finite Field Multiplier |
PC
2002
13 years 9 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
DCC
2008
IEEE
14 years 9 months ago
2008
IEEE
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...
BCS
2008
13 years 11 months ago
2008
In this work, a new algorithm is proposed for fast estimation of nonparametric multivariate kernel density, based on principal direction divisive partitioning (PDDP) of the data s...
ICISC
2000
13 years 11 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
ICML
2003
IEEE
14 years 10 months ago
2003
IEEE
We present a fast iterative support vector training algorithm for a large variety of different formulations. It works by incrementally changing a candidate support vector set usin...