Sciweavers

Share
16 search results - page 1 / 4
» Parallel sparse polynomial interpolation over finite fields
Sort
View
CAP
2010
8 years 7 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
ARITH
2009
IEEE
9 years 7 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 &...
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
9 years 1 days ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
TC
2002
8 years 11 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
MOC
1998
97views more  MOC 1998»
8 years 11 months ago
Euclid's algorithm and the Lanczos method over finite fields
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
Jeremy Teitelbaum
books