Sciweavers

97 search results - page 1 / 20
» Polynomial Multiplication over Finite Fields Using Field Ext...
Sort
View
ARITH
2009
IEEE
13 years 11 months ago
Polynomial Multiplication over Finite Fields Using Field Extensions and Interpolation
A method for polynomial multiplication over finite fields using field extensions and polynomial interpolation is introduced. The proposed method uses polynomial interpolation a...
Murat Cenk, Çetin Kaya Koç, Ferruh &...
CAP
2010
12 years 11 months ago
Parallel sparse polynomial interpolation over finite fields
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
STOC
2007
ACM
133views Algorithms» more  STOC 2007»
14 years 4 months ago
Interpolation of depth-3 arithmetic circuits with two multiplication gates
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
Amir Shpilka
TC
2002
13 years 4 months ago
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show ...
Zeljko Zilic, Zvonko G. Vranesic
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 4 months ago
Factoring Polynomials over Finite Fields using Balance Test
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
Chandan Saha