507 search results - page 11 / 102 » Computing Sparse Multiples of Polynomials |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
CANS
2011
Springer
12 years 7 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
CASC
2007
Springer
14 years 1 months ago
2007
Springer
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...