59 search results - page 3 / 12 » Fast Computation on Encrypted Polynomials and Applications |
CHES
2005
Springer
15 years 3 months ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
AAECC
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We give an algorithm for modular composition of degree n univariate polynomials over a finite field Fq requiring n1+o(1) log1+o(1) q bit operations; this had earlier been achiev...
83
Voted
DAC
2011
ACM
13 years 9 months ago
2011
ACM
Stochastic device noise has become a significant challenge for high-precision analog/RF circuits, and it is particularly difficult to correctly include both white noise and flic...
ACMSE
2006
ACM
15 years 1 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...