88 search results - page 12 / 18 » Subquadratic-time factoring of polynomials over finite field... |
JSC
2010
14 years 8 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
DCC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
92
Voted
ANTS
2010
Springer
15 years 1 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
TC
2008
14 years 9 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...