Abstract
Abstract T. Harayama and D. K. Friesen [J. Math. Cryptol. 1 (2007), 79–104] proposed the linearized binomial attack for multivariate quadratic cryptosystems and introduced weak Dembowski–Ostrom (DO) polynomials in this framework over the finite field 𝔽2. We extend the linearized binomial attack to multivariate quadratic cryptosystems over 𝔽 p for any prime p and redefine the weak DO polynomials for general case. We identify infinite 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
