Solvability of a System of Bivariate Polynomial Equations over a Finite Field

1. Gao, S., Kaltofen, E., Lauder, A.: Deterministic distinc-degree factorization of polnomials over finite fields. Journal of Symbolic Computing 38(6), 1461–1470 (2004)

   Article  MathSciNet  Google Scholar 

2. Huang, M.-D., Wong, Y.-C.: Solvability of systems of polynomial congruences modulo a large prime. Computational Complexity 8(3), 227–257 (1999)

   Article  MATH  MathSciNet  Google Scholar 

3. Lidl, R., Mullen, G.L.: When does a polynomial over a finite field permute the elements of the field? American Mathematical Monthly 95, 243–246 (1988)

   Article  MATH  MathSciNet  Google Scholar 

4. Lidl, R., Mullen, G.L.: When does a polynomial over a finite field permute the elements of the field?, II. American Mathematical Monthly 100, 71–74 (1993)

   Article  MATH  MathSciNet  Google Scholar 

5. Lidl, R., Muller, W.B.: Permutation Polynomials in RSA cryptosystems. In: Chaum, D. (ed.) Proceedings CRYPTO 1983, pp. 293–301 (1983)

   Google Scholar 

6. Ma, K., Von Zur Gathen, J.: The computational complexity of recognizing permutation functions. Computational Complexity 5(1), 76–97 (1995)

   Article  MATH  MathSciNet  Google Scholar 

7. Lenstra, H.: Private Communication (2005)

   Google Scholar 

8. Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)

   Article  MATH  MathSciNet  Google Scholar 

9. Bach, E.: Weil bounds for singular curves. Applicable Algebra in Engineering, Communication and Computing 7, 289–298 (1996)

   Article  MATH  MathSciNet  Google Scholar 

Download references