Max-PoSSo

Introduction

Solving polynomial systems with noise over F2, which is called as the Max-PoSSo problem over F2, is the problem of finding a solution of a given Boolean polynomial system, such that the solution can satisfy the maximum number of polynomials [1].

F2上有噪声的多项式系统的求解就是极大布尔多项式方程组可满足问题；对于给定的布尔多项式系统，找出一组解，满足最大数目的多项式 是密码学也是计算机领域的一个基本问题

  • cryptography：代数攻击、侧信道攻击、LPN/LWE体系的分析
  • 计算机复杂度：满足问题的最大方程 NP-hard