The vectorial nonlinearity of a vector-valued function is its distance from the set of affine functions. In 2017, Liu, Mesnager, and Chen conjectured a general upper bound for the vectorial linearity. Recently, Carlet...
详细信息
The vectorial nonlinearity of a vector-valued function is its distance from the set of affine functions. In 2017, Liu, Mesnager, and Chen conjectured a general upper bound for the vectorial linearity. Recently, Carlet established a lower bound in terms of differential uniformity. In this paper, we improve Carlet's lower bound. Our approach is based on the fact that the level sets of a vectorialboolean function are thin sets. In particular, level sets of APN functions are Sidon sets, hence the Liu-Mesnager-Chen conjecture predicts that in F 2 n , there should be Sidon sets of size at least 2 n / 2 + 1 for all n. This paper provides an overview of the known large Sidon sets in F 2 n , and examines the completeness of the large Sidon sets derived from hyperbolas and ellipses of the finite affine plane. (c) 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
A general mathematical framework behind algebraic cryptanalytic attacks is developed. The framework relates to finding algebraic equations induced by vectorial boolean functions and, in particular, equations of low al...
详细信息
A general mathematical framework behind algebraic cryptanalytic attacks is developed. The framework relates to finding algebraic equations induced by vectorial boolean functions and, in particular, equations of low algebraic degree. The equations may involve only a subset of input variables and may or may not be conditioned on the values of output variables. In addition, the equations may have a constrained form interesting for the so-called fast algebraic attacks. A possible divide-and-conquer effect is pointed out and the notion of algebraic immunity order, naturally extending the notion of correlation immunity order, is defined. An application of general results to stream ciphers known as combiners with or without memory, with possibly multiple outputs, is studied in particular detail and the concept of divide-and-conquer algebraic attacks is introduced. Special properties of combiners with finite input memory, such as nonlinear filter generators, are also established. It is also pointed out that Grijbner basis algorithms may be used for finding low-degree induced algebraic equations.
We study the relation among some security parameters for vectorial boolean functions which prevent attacks on the related block cipher. We focus our study on a recently-introduced security criterion, called weak diffe...
详细信息
We study the relation among some security parameters for vectorial boolean functions which prevent attacks on the related block cipher. We focus our study on a recently-introduced security criterion, called weak differential uniformity, which prevents the existence of an undetectable trapdoor based on imprimitive group action. We present some properties of functions with low weak differential uniformity, especially for the case of power functions and 4-bit S-Boxes.
booleanfunctions and vectorial boolean functions are the most important components of stream ciphers. Their cryptographic properties are crucial to the security of the underlying ciphers. And how to construct such fu...
详细信息
booleanfunctions and vectorial boolean functions are the most important components of stream ciphers. Their cryptographic properties are crucial to the security of the underlying ciphers. And how to construct such functions with good cryptographic properties is a nice problem that worth to be investigated. In this paper, using two small nonlinear functions with t - 1 resiliency, we provide a method on constructing t-resilient n variables booleanfunctions with strictly almost optimal non-linearity > 2(n-1) - 2(n/2) and optimal algebraic degree n - t - 1. Based on the method, we give another construction so that a large class of resilient vectorial boolean functions can be obtained. It is shown that the vectorial boolean functions also have strictly almost optimal nonlinearity and optimal algebraic degree.
The nonlinearity of a boolean function F : F-2(m) -> F-2 is the minimum Hamming distance between f and all affine functions. The nonlinearity of a S-box f : F-2(m) -> F-2(n) is the minimum nonlinearity of its co...
详细信息
The nonlinearity of a boolean function F : F-2(m) -> F-2 is the minimum Hamming distance between f and all affine functions. The nonlinearity of a S-box f : F-2(m) -> F-2(n) is the minimum nonlinearity of its component (boolean) functions upsilon center dot f, upsilon epsilon F-2(n)\ functions. This notion quantifies the level of resistance of the S-box to the linear attack. In this paper, the distribution of the nonlinearity of (m, n)-functions is investigated. When n = 1, it is known that asymptotically, almost all m-variable booleanfunctions have high nonlinearities. We extend this result to (m, n)-functions.
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 i...
详细信息
ISBN:
(纸本)9783030882389;9783030882372
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 paper presents a theoretical characterization of the DLCT, which corresponds to an autocorrelation table (ACT) of a vectorialboolean function. We further provide some new theoretical results on ACTs of vectorial boolean functions.
vectorial boolean functions are used as substitution boxes in cryptosystems. Designing inequivalent functions resistant to known attacks is one of the challenges in cryptography. In doing this, finding a fast techniqu...
详细信息
ISBN:
(纸本)9783319162768;9783319162775
vectorial boolean functions are used as substitution boxes in cryptosystems. Designing inequivalent functions resistant to known attacks is one of the challenges in cryptography. In doing this, finding a fast technique for determining whether two given functions are equivalent is a significant problem. A special class of the equivalence called restricted extended affine (REA) equivalence is studied in this paper. We update the verification procedures of the REA-equivalence types given in the recent work of Budaghyan and Kazymyrov (2012). In particular, we solve the system of linear equations simultaneously in the verification procedures to get better complexity. We also present the explicit number of operations of the verification procedures of these REA-equivalence types. Moreover, we construct two new REA-equivalence types and present the verification procedures of these types with their complexities.
The differential-linear connectivity table (DLCT) of a vectorialboolean function was recently introduced by Bar-On et al. at EUROCRYPT'19, whose value at a point is related to the autocorrelation value of its com...
详细信息
The differential-linear connectivity table (DLCT) of a vectorialboolean function was recently introduced by Bar-On et al. at EUROCRYPT'19, whose value at a point is related to the autocorrelation value of its component functions. Further, in INDOCRYPT'19, we proposed a new construction method for vectorial boolean functions with very low differentiallinear uniformity using Maiorana-McFarland bent functions. The difficulty of that construction method was to identify the permutations and the sub-functions that satisfy the conditions to attain good cryptographic properties. In this paper we discover novel techniques to construct such sub-functions to generate vectorial boolean functions with substantially improved cryptographic properties. Our proposed methods are based on ideas from combinatorics as well as finite fields. In particular, we construct the sub-functions to generate (4t, t - 1)-function, t >= 5, in a different manner than our Indocrypt'19 paper. Further our new methods help in obtaining sub-functions to generate balanced (4t + 2, t - 1)function and (2k, k)-function with very good nonlinearity and very low differential-linear uniformity, that were never demonstrated earlier. (c) 2021 Elsevier Inc. All rights reserved.
vectorial boolean functions are used as the nonlinear components in stream *** security of the cipher system depends on the cryptographic properties of the *** widely accepted criteria are balancedness,high nonlineari...
详细信息
vectorial boolean functions are used as the nonlinear components in stream *** security of the cipher system depends on the cryptographic properties of the *** widely accepted criteria are balancedness,high nonlinearity,correlation immune and so *** this paper,we present a new construction method of balanced vectorial boolean functions with strictly almost optimal *** the first time,the first-order correlation immune functions with currently best known nonlinearity 2n-1-2n/2-1-2[n/4」 are *** is also shown that our functions can have good algebraic degree.
vectorial boolean functions play an important role in cryptography. How to construct vectorial boolean functions with good cryptographic properties is a nice problem that worth to be investigated. In this paper we pre...
详细信息
vectorial boolean functions play an important role in cryptography. How to construct vectorial boolean functions with good cryptographic properties is a nice problem that worth to be investigated. In this paper we present several constructions of balanced vectorial boolean functions with high algebraic immunity, high (or optimum) algebraic degree, and very high nonlinearity. In some cases, the constructed functions also achieve optimum algebraic immunity.
暂无评论