The Necessary and Sufficient Condition of the Families of Bent Complementary Function Pairs
3
Citation
1
Reference
10
Related Paper
Citation Trend
Abstract:
摘要: 该文在研究Bent互补函数偶族性质的基础上,证明了Bent互补函数偶族与Hadamard互补矩阵偶族等价关系,即Bent互补函数偶族的构造充分必要条件,给出了Bent互补函数偶族的一种构造方法。根据等价关系,该文实质上也给出了Hadamard互补矩阵偶族的性质、构造方法,这些表明Bent互补函数偶族在最佳信号设计方面有广阔的应用前景。 关键词: 编码理论; Bent函数; Bent互补函数偶族; 充要条件Keywords:
Bent function
Bent functions are Boolean functions which have maximum possible nonlinearity i.e. maximal distance to the set of affine functions. They were introduced by Rothaus in 1976. In the last two decades, they have been studied widely due to their interesting combinatorial properties and their applications in cryptography. However the complete classification of bent functions has not been achieved yet. In 2001 Youssef and Gong introduced a subclass of bent functions which they called hyper-bent functions. The construction of hyper-bent functions is generally more difficult than the construction of bent functions. In this thesis we give a survey of recent constructions of infinite classes of bent and hyper-bent functions where the classification is obtained through the use of Kloosterman and cubic sums and Dickson polynomials.
Bent function
Kloosterman sum
Cite
Citations (0)
Bent functions are maximally nonlinear Boolean functions with an even number of variables. They were introduced by Rothaus in 1976. For their own sake as interesting combinatorial objects, but also because of their relations to coding theory (Reed-Muller codes) and applications in cryptography (design of stream ciphers), they have attracted a lot of research, specially in the last 15 years. The class of bent functions contains a subclass of functions, introduced by Youssef and Gong in 2001, the so-called hyper-bent functions whose properties are still stronger and whose elements are still rarer than bent functions. Bent and hyper-bent functions are not classified. A complete classification of these functions is elusive and looks hopeless. So, it is important to design constructions in order to know as many of (hyper)-bent functions as possible. This paper is devoted to the constructions of bent and hyper-bent Boolean functions in polynomial forms. We survey and present an overview of the constructions discovered recently. We extensively investigate the link between the bentness property of such functions and some exponential sums (involving Dickson polynomials).
Bent function
Coding theory
Cite
Citations (5)
Bent function
Cite
Citations (9)
The paper is dealing with two important subclasses of plateaued functions: bent and semi-bent functions. In the first part of the paper, we construct mainly bent and semi-bent functions in the Maiorana-McFarland class using Boolean functions having linear structures (linear translators) systematically. Although most of these results are rather direct applications of some recent results, using linear structures (linear translators) allows us to have certain flexibilities to control extra properties of these plateaued functions. In the second part of the paper, using the results of the first part and exploiting these flexibilities, we modify many secondary constructions. Therefore, we obtain new secondary constructions of bent and semi-bent functions not belonging to the Maiorana-McFarland class. Instead of using bent (semi-bent) functions as ingredients, our secondary constructions use only Boolean (vectorial Boolean) functions with linear structures (linear translators) which are very easy to choose. Moreover, all of them are very explicit and we also determine the duals of the bent functions in our constructions. We show how these linear structures should be chosen in order to satisfy the corresponding conditions coming from using derivatives and quadratic/cubic functions in our secondary constructions.
Bent function
Dual polyhedron
Cite
Citations (0)
As an optimal combinatorial object, bent functions have been an interesting research object due to their important applications in cryptography, coding theory, and sequence design. The characterization and construction of bent functions are challenging problems in general. The objective of this paper is to present a construction of p-ary weakly regular bent functions from known weakly regular bent functions. This generalizes some earlier constructions of Boolean bent functions and p-ary bent functions, and produces several infinite families of p-ary weakly regular bent functions from known ones. Some infinite families of p-ary rotation symmetric bent functions are obtained as well.
Bent function
Coding theory
Cite
Citations (7)
Bent function
Characterization
Cite
Citations (37)
In this paper we show that several classes of already known cryptographic Boolean functions are either bent-based (BB) functions or linear-based (LB) functions. In particular, we show that all nonlinear resilient functions with maximum resiliency order, i.e. (n, n-3, 2, 2 n-2 ) functions, are either BB or LB. We provide an explicit count for the functions in both classes. We also show that all symmetric bent functions that achieve the maximum possible nonlinearity are bent-based: for n even, we have 4 bent-based symmetric bent functions and for n odd, we also have 4 bent-based symmetric functions. Furthermore, we prove that there are no BB homogeneous functions with algebraic degree>2 and we provide a count for LB homogeneous functions. Some of the results obtained are extended to functions over GF(p)
Bent function
Cite
Citations (0)
In this paper, we first present two systematic constructions of bent functions by modifying the truth tables of Rothaus's bent function and Maiorana-McFarland's bent function respectively. The number of the newly constructed bent functions by modifying the truth table of Rothaus's bent function is also determined. The methods of constructing self-dual bent functions are then given after the dual functions of these bent functions being determined. Finally, as an application, two constructions of 2-rotation symmetric bent functions are presented in this paper.
Bent function
Cite
Citations (7)
Bent and vectorial bent functions have applications in cryptography and coding and are closely related to objects in combinatorics and finite geometry, like difference sets, relative difference sets, designs and divisible designs. Bent functions with certain additional properties yield partial difference sets of which the Cayley graphs are always strongly regular. In this article we continue research on connections between bent functions and partial difference sets respectively strongly regular graphs. For the first time we investigate relations between vectorial bent functions and partial difference sets. Remarkably, properties of the set of the duals of the components play here an important role. Seeing conventional bent functions as 1-dimensional vectorial bent functions, some earlier results on strongly regular graphs from bent functions follow from our more general results. Finally we describe a recursive construction of infinitely many partial difference sets with a secondary construction of p-ary bent functions.
Bent function
Dual polyhedron
Strongly regular graph
Coding theory
Cite
Citations (12)
Bent function
Degree (music)
GF(2)
Cite
Citations (0)