arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1112.6263cs.SCcs.CR
收藏

二次布尔系统求解的复杂性

On the Complexity of Solving Quadratic Boolean Systems

Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer

摘要:

计算机科学中的一个基本问题是在$\mathbb{F}_2$上的$n$未知数中找到$m$二次多项式的所有公共零点。对几种现代密码的密码分析都归结为这个问题。到目前为止,最好的复杂性界是通过$4\log_2 n\,2^n$操作的穷举搜索达到的。我们给出了一个算法,减少了问题的穷举搜索和稀疏线性代数的组合。根据线性代数步骤所使用的方法,该算法有几种变体。在精确的代数假设下的输入系统,我们表明,我们的算法的确定性的变种有界的复杂性由$O(2^{0.841n})$时$m=n$,而拉斯维加斯类型的概率变体具有预期的复杂性$O(2^{0.792n})$。随机系统的实验表明,代数假设满足概率非常接近~1。我们还粗略估计了我们的方法和穷举搜索之间的实际阈值,该阈值低至~200,因此与密码学应用非常相关。

英文摘要:

A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity bound was reached by an exhaustive search in $4\log_2 n\,2^n$ operations. We give an algorithm that reduces the problem to a combination of exhaustive search and sparse linear algebra. This algorithm has several variants depending on the method used for the linear algebra step. Under precise algebraic assumptions on the input system, we show that the deterministic variant of our algorithm has complexity bounded by $O(2^{0.841n})$ when $m=n$, while a probabilistic variant of the Las Vegas type has expected complexity $O(2^{0.792n})$. Experiments on random systems show that the algebraic assumptions are satisfied with probability very close to~1. We also give a rough estimate for the actual threshold between our method and exhaustive search, which is as low as~200, and thus very relevant for cryptographic applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑