88 search results - page 13 / 18 » Subquadratic-time factoring of polynomials over finite field... |
76
Voted
MOC
2000
14 years 9 months ago
2000
Abstract. The distribution of ideal class groups of Fq(T, M(T)) is examined for degree-four monic polynomials M Fq[T] when Fq is a finite field of characteristic greater than 3 wi...
ISAAC
2010
Springer
14 years 7 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
ANTS
2008
Springer
14 years 11 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
77
Voted
PKC
2000
Springer
15 years 1 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
ADG
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...