24,183 research outputs found

    Bent functions of maximal degree

    Get PDF
    In this article a technique for constructing p-ary bent functions from plateaued functions is presented. This generalizes earlier techniques of constructing bent from near-bent functions. The Fourier spectrum of quadratic monomials is analysed, examples of quadratic functions with highest possible absolute values in their Fourier spectrum are given. Applying the construction of bent functions to the latter class of functions yields bent functions attaining upper bounds for the algebraic degree when p=3,5p=3,5. Until now no construction of bent functions attaining these bounds was known

    A construction of bent functions from plateaued functions

    Get PDF
    In this presentation, a technique for constructing bent functions from plateaued functions is introduced and analysed. 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 function with some additional properties that enable the construction of strongly regular graphs are constructed, and explicit expressions for bent functions with maximal degree are presented

    On the Systematic Constructions of Rotation Symmetric Bent Functions with Any Possible Algebraic Degrees

    Full text link
    In the literature, few constructions of nn-variable rotation symmetric bent functions have been presented, which either have restriction on nn or have algebraic degree no more than 44. In this paper, for any even integer n=2m2n=2m\ge2, a first systemic construction of nn-variable rotation symmetric bent functions, with any possible algebraic degrees ranging from 22 to mm, is proposed

    On the normality of pp-ary bent functions

    Full text link
    Depending on the parity of nn and the regularity of a bent function ff from Fpn\mathbb F_p^n to Fp\mathbb F_p, ff can be affine on a subspace of dimension at most n/2n/2, (n1)/2(n-1)/2 or n/21n/2- 1. We point out that many pp-ary bent functions take on this bound, and it seems not easy to find examples for which one can show a different behaviour. This resembles the situation for Boolean bent functions of which many are (weakly) n/2n/2-normal, i.e. affine on a n/2n/2-dimensional subspace. However applying an algorithm by Canteaut et.al., some Boolean bent functions were shown to be not n/2n/2- normal. We develop an algorithm for testing normality for functions from Fpn\mathbb F_p^n to Fp\mathbb F_p. Applying the algorithm, for some bent functions in small dimension we show that they do not take on the bound on normality. Applying direct sum of functions this yields bent functions with this property in infinitely many dimensions.Comment: 13 page
    corecore