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.
The Maximum Nonlinearity of 8-variable Balanced Boolean Functions is 116
School of Computer and Electronic Information/School of Artificial Intelligence, Nanjing Normal University(南京师范大学计算机与电子信息学院/人工智能学院);China Telecom Corporation Limited, Huaibei Branch(中国电信股份有限公司淮北分公司)
On the Differential Linear Connectivity Table of Vectorial Boolean Functions
Vectorial Boolean functions are crucial building blocks in symmetric ciphers. Different known attacks on block ciphers have resulted in diverse cryptographic criteria of vectorial Boolean functions,such as differential distribution table and nonlinearity. Very recently, Bar-On et al. introduced at Eurocrypt'19 a new tool, called the Differential-Linear Connectivity Table (DLCT).This paper is a follow-up work, which presents further theoretical characterization of the DLCT of vectorial Boolean functions and also investigates this new criterion of functions with certain forms. In this paper we i…
On the Differential-Linear Connectivity Table of Vectorial Boolean Functions
Vectorial Boolean functions are crucial building-blocks in symmetric ciphers. Different known attacks on block ciphers have resulted in diverse cryptographic criteria for vectorial Boolean functions, such as differential uniformity and nonlinearity. Very recently, Bar-On et al. introduced at Eurocrypt'19 a new tool, called the differential-linear connectivity table (DLCT), which allows for taking into account the dependency between the two subciphers $E_0$ and $E_1$ involved in differential-linear attacks. This new notion leads to significant improvements of differential-linear attacks on seve…
现代数据集的规模不断增长,需要将大规模计算拆分为较小的计算,并以分布式方式进行操作。分布式系统中的攻击者故意发送错误数据,以影响计算。布尔函数是许多应用的关键组件,例如,区块链系统中的验证功能和加密算法的设计。我们考虑在分布式计算系统中计算布尔函数的问题,特别关注\emph{security against Byzantine workers}。任何布尔函数一般都可以建模为一个高次的多元多项式。然而,安全阈值(即,可以容忍最大数量的对抗工作者,使得可以获得正确的结果),如果多项式的次数高,则由最近提出的拉格朗日编码计算(LCC)提供的计算可能非常低。我们提出了三种不同的方案,称为\emph{coded Algebraic normal form (ANF)},\emph{coded Disjunctive normal form (DNF)}和\emph{coded polynomial threshold function (PTF)}。所提出的方案的核心思想是将其建模为一些低次多项式和阈值函数的级联。在安全阈值方面,我们表明,建议的编码ANF和编码DNF是最佳的,通过提供一个匹配的外边界。