Welcome to the resource topic for 2006/075
Title:
ON THE WEIL SUM EVALUATION OF CENTRAL POLYNOMIAL IN MULTIVARIATE QUADRATIC CRYPTOSYSTEM
Authors: TOMOHIRO HARAYAMA
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.
ePrint: https://eprint.iacr.org/2006/075
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .