Sciweavers

1400 search results - page 14 / 280
» On multiplication in finite fields
Sort
View
AAECC
1997
Springer
115views Algorithms» more  AAECC 1997»
13 years 11 months ago
Efficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
Laurent Bernardin, Michael B. Monagan
FFA
2008
76views more  FFA 2008»
13 years 7 months ago
On the subset sum problem over finite fields
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
Jiyou Li, Daqing Wan
DCC
2008
IEEE
14 years 7 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Factoring Polynomials over Finite Fields using Balance Test
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
Chandan Saha
DCC
2006
IEEE
14 years 7 months ago
A New Characterization of Semi-bent and Bent Functions on Finite Fields*
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 ...
Khoongming Khoo, Guang Gong, Douglas R. Stinson