CryptoDB
ON THE WEIL SUM EVALUATION OF CENTRAL POLYNOMIAL IN MULTIVARIATE QUADRATIC CRYPTOSYSTEM
Authors: | |
---|---|
Download: | |
Abstract: | 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 $F_{2}$. 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. |
BibTeX
@misc{eprint-2006-21568, title={ON THE WEIL SUM EVALUATION OF CENTRAL POLYNOMIAL IN MULTIVARIATE QUADRATIC CRYPTOSYSTEM}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / MQ problem, MQ trapdoor function, multivariate quadratic cryptosystem, Dembwoski-Ostrom polynomial, central polynomial, character and Weil sum.}, url={http://eprint.iacr.org/2006/075}, note={ harayama@tamu.edu 13201 received 21 Feb 2006}, author={TOMOHIRO HARAYAMA}, year=2006 }