When does a polynomial over a finite field permute the elements of the fields?
American Mathematical Monthly
The computational complexity of recognizing permutation functions
Computational Complexity
Solvability of systems of polynomial congruences modulo a large prime
Computational Complexity
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Deterministic distinct-degree factorization of polynomials over finite fields
Journal of Symbolic Computation
Hi-index | 0.00 |
We investigate the complexity of the following polynomial solvability problem: Given a finite field ${\mathbb F}_{q}$ and a set of polynomials $$f_{1}(x,y),f_{2}(x,y),...,f_{n}(x,y),g(x,y) \ \epsilon \ {\mathbb F}_{q} [x,y]$$ determine the ${\mathbb F}_{q}$-solvability of the system $$f_{1}(x,y)=f_{2}(x,y)=...=f_{n}(x,y)=0 \ {\rm and} \ {\it g}(x,y) \neq 0$$ We give a deterministic polynomial-time algorithm for this problem.