Paper 2006/075 Original: eprint.iacr.org/2006/075 ↗
ON THE WEIL SUM EVALUATION OF CENTRAL POLYNOMIAL IN MULTIVARIATE QUADRATIC CRYPTOSYSTEM
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2006-02-24: last updated
- 2006-02-24: published
- Short URL
- https://ia.cr/2006/075
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/075,
author = {TOMOHIRO HARAYAMA},
title = {ON THE WEIL SUM EVALUATION OF CENTRAL POLYNOMIAL IN MULTIVARIATE QUADRATIC CRYPTOSYSTEM},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/075},
year = {2006},
url = {https://eprint.iacr.org/2006/075}
}