Boolean Ring Cryptographic Equation Solving

This paper considers multivariate polynomial equation systems over GF(2) that have a small number of solutions. This paper gives a newmethod EGHAM2 for solving such systems of equations that uses the properties of the Boolean quotient ring to potentially reduce memory and time complexity relative to existing XL-type or Grobner basis algorithms applied in this setting. This paper also establishes a direct connection between solving such a multivariate polynomial equation system over GF(2), an MQ problem, and an instance of the LPN problem.