14 research outputs found

    Semifields, relative difference sets, and bent functions

    Full text link
    Recently, the interest in semifields has increased due to the discovery of several new families and progress in the classification problem. Commutative semifields play an important role since they are equivalent to certain planar functions (in the case of odd characteristic) and to modified planar functions in even characteristic. Similarly, commutative semifields are equivalent to relative difference sets. The goal of this survey is to describe the connection between these concepts. Moreover, we shall discuss power mappings that are planar and consider component functions of planar mappings, which may be also viewed as projections of relative difference sets. It turns out that the component functions in the even characteristic case are related to negabent functions as well as to Z4\mathbb{Z}_4-valued bent functions.Comment: Survey paper for the RICAM workshop "Emerging applications of finite fields", 09-13 December 2013, Linz, Austria. This article will appear in the proceedings volume for this workshop, published as part of the "Radon Series on Computational and Applied Mathematics" by DeGruyte

    Systematic Constructions of Bent-Negabent Functions, 2-Rotation Symmetric Bent-Negabent Functions and Their Duals

    Full text link
    Bent-negabent functions have many important properties for their application in cryptography since they have the flat absolute spectrum under the both Walsh-Hadamard transform and nega-Hadamard transform. In this paper, we present four new systematic constructions of bent-negabent functions on 4k,8k,4k+24k, 8k, 4k+2 and 8k+28k+2 variables, respectively, by modifying the truth tables of two classes of quadratic bent-negabent functions with simple form. The algebraic normal forms and duals of these constructed functions are also determined. We further identify necessary and sufficient conditions for those bent-negabent functions which have the maximum algebraic degree. At last, by modifying the truth tables of a class of quadratic 2-rotation symmetric bent-negabent functions, we present a construction of 2-rotation symmetric bent-negabent functions with any possible algebraic degrees. Considering that there are probably no bent-negabent functions in the rotation symmetric class, it is the first significant attempt to construct bent-negabent functions in the generalized rotation symmetric class

    A New Class of Bent--Negabent Boolean Functions

    Get PDF
    In this paper we develop a technique of constructing bent--negabent Boolean functions by using complete mapping polynomials. Using this technique we demonstrate that for each β„“β‰₯2\ell \ge 2 there exits bent--negabent functions on n=12β„“n = 12\ell variables with algebraic degree n4+1=3β„“+1\frac{n}{4}+1 = 3\ell + 1. It is also demonstrated that there exist bent--negabent functions on 88 variables with algebraic degrees 22, 33 and 44

    Generalizations of Bent Functions. A Survey

    Get PDF
    Bent functions (Boolean functions with extreme nonlinearity properties) are actively studied for their numerous applications in cryptography, coding theory, and other fields. New statements of problems lead to a large number of generalizations of the bent functions many of which remain little known to the experts in Boolean functions. In this article, we offer a systematic survey of them

    A note on semi-bent functions with multiple trace terms and hyperelliptic curves

    Get PDF
    Semi-bent functions with even number of variables are a class of important Boolean functions whose Hadamard transform takes three values. In this note we are interested in the property of semi-bentness of Boolean functions defined on the Galois field F2nF_{2^n} (n even) with multiple trace terms obtained via Niho functions and two Dillon-like functions (the first one has been studied by Mesnager and the second one have been studied very recently by Wang, Tang, Qi, Yang and Xu). We subsequently give a connection between the property of semi-bentness and the number of rational points on some associated hyperelliptic curves. We use the hyperelliptic curve formalism to reduce the computational complexity in order to provide a polynomial time and space test leading to an efficient characterization of semi-bentness of such functions (which includes an efficient characterization of the hyperbent functions proposed by Wang et al.). The idea of this approach goes back to the recent work of Lisonek on the hyperbent functions studied by Charpin and Gong
    corecore