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

利用简单算术运算构造具有高非线性度和良好代数攻击抵抗性的高效可实现 Boolean 函数

Use of Simple Arithmetic Operations to Construct Efficiently Implementable Boolean functions Possessing High Nonlinearity and Good Resistance to Algebraic Attacks

Claude Carlet, Palash Sarkar

AI总结:

提出一类通过整数与二元域简单算术构造的高效 Boolean 函数,在 n≤20 时实现非线性度与(快速)代数免疫性的最优折中。

摘要:

我们描述了一类新的 Boolean 函数,它们在低计算复杂度、非线性度和(快速)代数免疫性之间提供了目前已知的最佳折中。特别地,对于 n≤20,我们证明该函数族中存在一些函数,其非线性度与(快速)代数免疫性的组合优于任何其他高效可实现函数所能达到的结果。我们方法的主要创新点在于,将简单整数算术与二元域算术进行恰当组合,并应用于 Boolean 函数构造。

英文摘要:

We describe a new class of Boolean functions which provide the presently best known trade-off between low computational complexity, nonlinearity and (fast) algebraic immunity. In particular, for $n\leq 20$, we show that there are functions in the family achieving a combination of nonlinearity and (fast) algebraic immunity which is superior to what is achieved by any other efficiently implementable function. The main novelty of our approach is to apply a judicious combination of simple integer and binary field arithmetic to Boolean function construction.

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

↑