47 search results - page 2 / 10 » Testing Low-Degree Polynomials over Prime Fields |
JCT
2011
13 years 6 days ago
2011
STOC
2010
ACM
14 years 2 months ago
2010
ACM
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the foll...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
For counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof’s algorithm. We present several improvements on...
JCT
2008
13 years 5 months ago
2008
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a nonplanar set in AG(3, p)...