Sciweavers

237 search results - page 8 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 7 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
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
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
ARITH
1999
IEEE
13 years 12 months ago
Montgomery Modular Exponentiation on Reconfigurable Hardware
It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are...
Thomas Blum
AAECC
2005
Springer
104views Algorithms» more  AAECC 2005»
13 years 7 months ago
Isomorphism Classes of Picard Curves over Finite Fields
In this paper we determine the number of isomorphism classes of Picard curves, i.e., superelliptic curves y3 = f(x) of genus three, over finite fields of characteristic different f...
Jong Won Lee