1400 search results - page 21 / 280 » On multiplication in finite fields |
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
CRYPTO
1998
Springer
13 years 11 months ago
1998
Springer
STOC
1995
ACM
13 years 11 months ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
STOC
1991
ACM
13 years 11 months ago
1991
ACM
We describe a new deterministic algorithm for the problem of constructing k-th
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...