Join Our Newsletter

DCC

2011

IEEE

8 years 1 months ago
2011

IEEE

Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the aﬃrmative in a special case, and outline a plaus...

FFA

2010

8 years 4 months ago
2010

We count the number of irreducible polynomials in several variables of a given degree over a ﬁnite ﬁeld. The results are expressed in terms of a generating series, an exact for...

JSC

1998

8 years 5 months ago
1998

We present an algorithm for computing the integral closure of a reduced ring that is ﬁnitely generated over a ﬁnite ﬁeld. Leonard and Pellikaan [4] devised an algorithm for c...

ISSAC

1997

Springer

8 years 10 months ago
1997

Springer

New algorithms are presented for factoring polynomials of degree n over the ﬁnite ﬁeld of q elements, where q is a power of a ﬁxed prime number. When log q = n1+a , where a ...

CRYPTO

2001

Springer

8 years 10 months ago
2001

Springer

Consider a network of processors among which elements in a ﬁnite ﬁeld K can be veriﬁably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...

CIE

2009

Springer

9 years 24 days ago
2009

Springer

Abstract. Let Fq be a ﬁnite ﬁeld with q elements. We produce an (eﬀective) elimination of quantiﬁers for the structure of the set of polynomials, Fq[t], of one variable, in...