290 search results - page 25 / 58 » Pseudorandom Bits for Polynomials |
ICMS
2010
14 years 7 months ago
2010
Abstract. Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its ...
103
click to vote
FOCS
1991
IEEE
15 years 1 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
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...
AINA
2007
IEEE
2007
IEEE
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
15 years 4 months ago
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
DELTA
2008
IEEE
15 years 4 months ago
2008
IEEE
Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twis...