19 search results - page 2 / 4 » Noisy interpolation of sparse polynomials in finite fields |
STOC
2007
ACM
14 years 5 months ago
2007
ACM
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...
DCC
2002
IEEE
14 years 5 months ago
2002
IEEE
Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field Fp by polynomials modulo p and modulo p -1, re...
MOC
1998
13 years 5 months ago
1998
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...
ICISC
2000
13 years 6 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
ISSAC
2009
Springer
13 years 12 months ago
2009
Springer
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...