arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.05932cs.ITmath.ACmath.IT
收藏

布尔函数非线性的多元多项式算法

An algorithmic approach using multivariate polynomials for the nonlinearity of Boolean functions

Emanuele Bellini, Teo Mora, Massimiliano Sala

摘要:

布尔函数的非线性度是决定其是否适用于密码学目的的关键属性,例如作为流密码中的组合函数,因此非线性度计算是应用中的重要问题。计算非线性的传统方法是基于变换,例如快速沃尔什变换。2007年,Simonetti提出了一种方法来解决上述问题,将其视为某些多元多项式系统解的存在性的决策问题。虽然新颖的方法,她的算法遭受了直接应用Groebner基地,因此是不切实际的。现在,我们提出了两种更实用的方法,一种是以更快的方式确定Simonetti系统的解的存在性,另一种是编写类似的系统,但在具有不同特征的领域。对于我们的算法,我们提供了一个有效的实现在软件包MAGMA。

英文摘要:

The nonlinearity of a Boolean function is a key property in deciding its suitability for cryptographic purposes, e.g. as a combining function in stream ciphers, and so the nonlinearity computation is an important problem for applications. Traditional methods to compute the nonlinearity are based on transforms, such as the Fast Walsh Transform. In 2007 Simonetti proposed a method to solve the above problem seen as a decision problem on the existence of solutions for some multivariate polynomial systems. Although novel as approach, her algorithm suffered from a direct application of Groebner bases and was thus impractical. We now propose two more practical approaches, one that determines the existence of solutions for Simonetti's systems in a faster way and another that writes similar systems but over fields with a different characteristics. For our algorithms we provide an efficient implementation in the software package MAGMA.

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

↑