Generalized Maiorana–McFarland class and normality of p-ary bent functions

A class of bent functions which contains bent functions with various properties like regular, weakly regular and not weakly regular bent functions in even and in odd dimension, is analyzed. It is shown that this class includes the Maiorana–McFarland class as a special case. Known classes and examples of bent functions in odd characteristic are examined for their relation to this class. In the second part, normality for bent functions in odd characteristic is analyzed. It turns out that differently to Boolean bent functions, many – also quadratic – bent functions in odd characteristic and even dimension are not normal. It is shown that regular Coulter–Matthews bent functions are normal.     

Binary linear codes from vectorial boolean functions and their weight distribution

Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary linear codes from vectorial Boolean functions and determine their parameters, by further studying a generic construction developed by Ding et al. recently. First, by employing perfect nonlinear functions and almost bent functions, we obtain several classes of six-weight linear codes which contain the all-one codeword, and determine their weight distribution. Second, we investigate a subcode of any linear code mentioned above and consider its parameters. When the vectorial Boolean function is a perfect nonlinear function or a Gold function in odd dimension, we can completely determine the weight distribution of this subcode. Besides, our linear codes have larger dimensions than the ones by Ding et al.’s generic construction.     

Authentication Schemes from Highly Nonlinear Functions

We construct two families of authentication schemes using highly nonlinear functions on finite fields of characteristic 2. This leads to improvements on an earlier construction by Ding and Niederreiter if one chooses, for instance, an almost bent function as the highly nonlinear function.     

Maximally Nonlinear Functions and Bent Functions

We give a construction of bent functions in 2n variables, here n is odd, by using maximally nonlinear functions on GF(2 ⁿ ).     

A construction of bent functions from plateaued functions

In this presentation, a technique for constructing bent functions from plateaued functions is introduced and analyzed. This generalizes earlier techniques for constructing bent from near-bent functions. Using this construction, we obtain a big variety of inequivalent bent functions, some weakly regular and some non-weakly regular. Classes of bent functions having some additional properties that enable the construction of strongly regular graphs are formed, and explicit expressions for bent functions with maximal degree are presented.     

On the <Emphasis Type="Italic">p</Emphasis>-ary (cubic) bent and plateaued (vectorial) functions

Plateaued functions play a significant role in cryptography, sequences for communications, and the related combinatorics and designs. Comparing to their importance, those functions have not been studied in detail in a general framework. Our motivation is to bring further results on the characterizations of bent and plateaued functions, and to introduce new tools which allow us firstly a better understanding of their structure and secondly to get methods for handling and designing such functions. We first characterize bent functions in terms of all even moments of the Walsh transform, and then plateaued (vectorial) functions in terms of the value distribution of the second-order derivatives. Moreover, we devote to cubic functions the characterization of plateaued functions in terms of the value distribution of the second-order derivatives, and hence this reveals non-existence of homogeneous cubic bent (and also (homogeneous) cubic plateaued for some cases) functions in odd characteristic. We use a rank notion which generalizes the rank notion of quadratic functions. This rank notion reveals new results about (homogeneous) cubic plateaued functions. Furthermore, we observe non-existence of a function whose absolute Walsh transform takes exactly 3 distinct values (one being zero). We finally provide a new class of functions whose absolute Walsh transform takes exactly 4 distinct values (one being zero).     

Strongly regular graphs constructed from <Emphasis Type="Italic">p</Emphasis>-ary bent functions

In this paper, we generalize the construction of strongly regular graphs in Tan et al. (J. Comb. Theory, Ser. A 117:668–682, 2010) from ternary bent functions to p-ary bent functions, where p is an odd prime. We obtain strongly regular graphs with three types of parameters. Using certain non-quadratic p-ary bent functions, our constructions can give rise to new strongly regular graphs for small parameters.     

A new class of generalized almost perfect nonlinear power function

As a generalization of almost perfect nonlinear functions, generalized almost perfect nonlinear (GAPN) functions defined over finite fields of odd characteristic have also important applications in cryptography and finite geometry. In this paper, we mainly focus on GAPN power functions, and a new class of such function (up to EA equivalence) is obtained. Furthermore, using our method, almost all the known GAPN power functions can be confirmed in a simple way.     

Relation between o-equivalence and EA-equivalence for Niho bent functions

Boolean functions, and bent functions in particular, are considered up to so-called EA-equivalence, which is the most general known equivalence relation preserving bentness of functions. However, for a special type of bent functions, so-called Niho bent functions there is a more general equivalence relation called o-equivalence which is induced from the equivalence of o-polynomials. In the present work we study, for a given o-polynomial, a general construction which provides all possible o-equivalent Niho bent functions, and we considerably simplify it to a form which excludes EA-equivalent cases. That is, we identify all cases which can potentially lead to pairwise EA-inequivalent Niho bent functions derived from o-equivalence of any given Niho bent function. Furthermore, we determine all pairwise EA-inequivalent Niho bent functions arising from all known o-polynomials via o-equivalence.     

Characterizing the Structures of Cryptographic Functions Satisfying the Propagation Criterion for Almost All Vectors

Many practical information authentication techniques are based on such cryptographic means as data encryption algorithms and one-way hash functions. A core component of such algorithms and functions are nonlinear functions. In this paper, we reveal a relationship between nonlinearity and propagation characteristic, two critical indicators of the cryptographic strength of a Boolean function. We also investigate the structures of functions that satisfy the propagation criterion with respect to all but six or less vectors. We show that these functions have close relationships with bent functions, and can be easily constructed from the latter.     

Affine inequivalence of cubic Maiorana–McFarland type bent functions

We consider cubic Maiorana–McFarland type bent functions having no affine derivatives. By using an invariant proposed by Dillon in 1975 we identify subclasses of inequivalent bent functions within this class. These can also be identified by [4, Theorem B]. However, our technique involves only elementary derivations. We also include some computational results.     

Galois环和Z/(m)环上完全非线性函数的性质

本文把完全非线性函数推广到了有限Abel群上,利用特征谱讨论了Z/(m)上Bent函数与GF(pe)上bent函数以及完全非线性函数定义之间的关系;给出Galois环与Z/(m)上最佳线性逼近的特征谱表示,得到完全非线性函数在某种程度上能抵抗最佳线性逼近攻击的结论;并给出一种Galois环与Z/(m)环上完全非线性函数的构结方法.     

Dynamic stability of the three‐dimensional axisymmetric Navier‐Stokes equations with swirl

In this paper, we study the dynamic stability of the three‐dimensional axisymmetric Navier‐Stokes Equations with swirl. To this purpose, we propose a new one‐dimensional model that approximates the Navier‐Stokes equations along the symmetry axis. An important property of this one‐dimensional model is that one can construct from its solutions a family of exact solutions of the three‐dimensionaFinal Navier‐Stokes equations. The nonlinear structure of the one‐dimensional model has some very interesting properties. On one hand, it can lead to tremendous dynamic growth of the solution within a short time. On the other hand, it has a surprising dynamic depletion mechanism that prevents the solution from blowing up in finite time. By exploiting this special nonlinear structure, we prove the global regularity of the three‐dimensional Navier‐Stokes equations for a family of initial data, whose solutions can lead to large dynamic growth, but yet have global smooth solutions. © 2007 Wiley Periodicals, Inc.     

Association schemes arising from bent functions

We give a construction of 3-class and 4-class association schemes from s-nonlinear and differentially 2 ^s -uniform functions, and a construction of p-class association schemes from weakly regular p-ary bent functions, where p is an odd prime.     

On the Loewy Length and the Noetherian Dimension of Artinian Modules

The problem of computing the automorphism groups of an elementary Abelian Hadamard difference set or equivalently of a bent function seems to have attracted not much interest so far. We describe some series of such sets and compute their automorphism group. For some of these sets the construction is based on the nonvanishing of the degree 1-cohomology of certain Chevalley groups in characteristic two. We also classify bent functions f such that Aut(f) together with the translations from the underlying vector space induce a rank 3 group of automorphisms of the associated symmetric design. Finally, we discuss computational aspects associated with such questions.     

完美非线性映射的一类构造

在分组密码中 ,为了抗差分攻击 ,需要完美非线性映射 .利用有限域 Zp上的广义 Bent函数和不可约多项式 ,给出了完美非线性映射的一类构造 .     

A new construction of bent functions based on {\mathbb{Z}} -bent functions

Dobbertin has embedded the problem of construction of bent functions in a recursive framework by using a generalization of bent functions called ${\mathbb{Z}}$ -bent functions. Following his ideas, we generalize the construction of partial spreads bent functions to partial spreads ${\mathbb{Z}}$ -bent functions of arbitrary level. Furthermore, we show how these partial spreads ${\mathbb{Z}}$ -bent functions give rise to a new construction of (classical) bent functions. Further, we construct a bent function on 8 variables which is inequivalent to all Maiorana–McFarland as well as PS _ap type bents. It is also shown that all bent functions on 6 variables, up to equivalence, can be obtained by our construction.     

On data depth in infinite dimensional spaces

The concept of data depth leads to a center-outward ordering of multivariate data, and it has been effectively used for developing various data analytic tools. While different notions of depth were originally developed for finite dimensional data, there have been some recent attempts to develop depth functions for data in infinite dimensional spaces. In this paper, we consider some notions of depth in infinite dimensional spaces and study their properties under various stochastic models. Our analysis shows that some of the depth functions available in the literature have degenerate behaviour for some commonly used probability distributions in infinite dimensional spaces of sequences and functions. As a consequence, they are not very useful for the analysis of data satisfying such infinite dimensional probability models. However, some modified versions of those depth functions as well as an infinite dimensional extension of the spatial depth do not suffer from such degeneracy and can be conveniently used for analyzing infinite dimensional data.     

The ranks of Maiorana-McFarland bent functions

In this paper, the ranks of a special family of Maiorana-McFarland bent functions are discussed. The upper and lower bounds of the ranks are given and those bent functions whose ranks achieve these bounds are determined. As a consequence, the inequivalence of some bent functions are derived. Furthermore, the ranks of the functions of this family are calculated when t 6.     

A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity

In this paper, a combinatorial conjecture about binary strings is proposed. Under the assumption that the proposed conjecture is correct, two classes of Boolean functions with optimal algebraic immunity can be obtained. The functions in first class are bent, and then it can be concluded that the algebraic immunity of bent functions can take all possible values except one. The functions in the second class are balanced, and they have optimal algebraic degree and the best nonlinearity up to now.