97 search results - page 5 / 20 » Polynomial Multiplication over Finite Fields Using Field Ext... |
MOC
1998
13 years 6 months ago
1998
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
ISSAC
2007
Springer
14 years 26 days ago
2007
Springer
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
INDOCRYPT
2001
Springer
13 years 11 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
TC
1998
13 years 6 months ago
1998
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...
AAECC
1997
Springer
13 years 11 months ago
1997
Springer
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...