97 search results - page 9 / 20 » Finding roots of polynomials over finite fields |
151
click to vote
CALC
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N, and the companion problem of fi...
106
click to vote
AAECC
1997
Springer
15 years 3 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...
FOCS
1998
IEEE
15 years 3 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
80
Voted
SODA
1992
ACM
15 years 25 days ago
1992
ACM
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
97
Voted
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We give a deterministic polynomial-time algorithm that computes a nontrivial rational point on an elliptic curve over a finite field, given a Weierstrass equation for the...