97 search results - page 8 / 20 » Finding roots of polynomials over finite fields |
CMA
2010
13 years 4 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
In this paper, we present an algorithm that given a fixed prime power q and a positive integer N, finds an integer n [N, 2qN] and an element Fqn of order greater than 5.8n/ log...
MOC
1998
13 years 7 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...
FOCM
2008
13 years 7 months ago
2008
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
ISSAC
2009
Springer
14 years 1 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...