72 search results - page 1 / 15 » A Modular Method for Computing the Splitting Field of a Poly... |
ANTS
2006
Springer
14 years 2 months ago
2006
Springer
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
JSC
2010
13 years 9 months ago
2010
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
IJNSEC
2010
13 years 5 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
ISSAC
2004
Springer
14 years 4 months ago
2004
Springer
Let L be an algebraic function field in k ≥ 0 parameters t1, . . . , tk. Let f1, f2 be non-zero polynomials in L[x]. We give two algorithms for computing their gcd. The first,...
ISSAC
2007
Springer
14 years 5 months 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...