Classes of weak Dembowski-Ostrom polynomials for multivariate quadratic cryptosystems

ALAM, Bilal
Özbudak, Ferruh
T. Harayama and D.K. Friesen [12] proposed the linearized binomial attack for multivariate quadratic cryptosystems and introduced weak Dembowski-Ostrom (DO) polynomials in this framework over the finite field F-2. We extend the linearized binomial attack to multivariate quadratic cryptosystems over F-p for any prime p and redefine the weak DO polynomials for general case. We identify in finite classes of weak DO polynomials for these systems by considering highly degenerate quadratic forms over algebraic function fields and Artin-Schreier type curves to achieve our results. This gives a general answer to the conjecture stated by Harayama and Friesen and also a partial enumeration of weak DO polynomials over finite fields.

Citation Formats
B. ALAM, F. Özbudak, and O. YAYLA, “Classes of weak Dembowski-Ostrom polynomials for multivariate quadratic cryptosystems,” JOURNAL OF MATHEMATICAL CRYPTOLOGY, vol. 9, no. 1, pp. 11–22, 2015, Accessed: 00, 2020. [Online]. Available: