Sciweavers

Share
DCC
2011
IEEE
8 years 1 months ago
Primitive polynomials, singer cycles and word-oriented linear feedback shift registers
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari
FFA
2010
84views more  FFA 2010»
8 years 4 months ago
Generating series for irreducible polynomials over finite fields
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact for...
Arnaud Bodin
JSC
1998
68views more  JSC 1998»
8 years 5 months ago
An Algorithm for Computing the Integral Closure
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field. Leonard and Pellikaan [4] devised an algorithm for c...
Theo De Jong
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
8 years 10 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
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 ...
Erich Kaltofen, Victor Shoup
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
8 years 10 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
CIE
2009
Springer
9 years 24 days ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
books