Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback

Gregory Morse

Classical lower bounds show that multiplying two degree-three polynomials over ${\mathbb{F}}_2$ requires nine scalar products in bilinear or quadratic models. They do not settle unres…