88 search results - page 10 / 18 » Subquadratic-time factoring of polynomials over finite field... |
87
Voted
MASCOTS
2001
14 years 11 months ago
2001
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
STOC
2007
ACM
15 years 9 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
2006
IEEE
15 years 9 months ago
2006
IEEE
We present a new characterization of semi-bent and bent quadratic functions on finite fields. First, we determine when a GF(2)-linear combination of Gold functions Tr(x2i +1 ) is ...
82
Voted
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
TC
1998
14 years 9 months ago
1998
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...