[Resource Topic] 2020/1255: Boolean Ring Cryptographic Equation Solving

Welcome to the resource topic for 2020/1255

Boolean Ring Cryptographic Equation Solving

Authors: Sean Murphy, Maura Paterson, Christine Swart


This paper considers multivariate polynomial equation systems over GF(2) that have a small number of solutions. This paper gives a new method 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 Groebner 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.

ePrint: https://eprint.iacr.org/2020/1255

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .