On the Weil Sum Evaluation of Central Polynomial in Multivariate Quadratic Cryptosystem
A parity checking-styled Weil sum algorithm is presented for a general class of the univariate polynomials which fully characterize a system of n polynomials in n variables over F2. The previously known proof methods of explicit Weil sum evaluation of Dembowski-Ostrom polynomials are extended to general case. The algorithm computes the absolute values of the Weil sums of the generic central polynomials in MQ problem.