2 research outputs found

    Two infinite classes of rotation symmetric bent functions with simple representation

    Full text link
    In the literature, few nn-variable rotation symmetric bent functions have been constructed. In this paper, we present two infinite classes of rotation symmetric bent functions on F2n\mathbb{F}_2^{n} of the two forms: {\rm (i)} f(x)=βˆ‘i=0mβˆ’1xixi+m+Ξ³(x0+xm,⋯ ,xmβˆ’1+x2mβˆ’1)f(x)=\sum_{i=0}^{m-1}x_ix_{i+m} + \gamma(x_0+x_m,\cdots, x_{m-1}+x_{2m-1}), {\rm (ii)} ft(x)=βˆ‘i=0nβˆ’1(xixi+txi+m+xixi+t)+βˆ‘i=0mβˆ’1xixi+m+Ξ³(x0+xm,⋯ ,xmβˆ’1+x2mβˆ’1)f_t(x)= \sum_{i=0}^{n-1}(x_ix_{i+t}x_{i+m} +x_{i}x_{i+t})+ \sum_{i=0}^{m-1}x_ix_{i+m}+ \gamma(x_0+x_m,\cdots, x_{m-1}+x_{2m-1}), \noindent where n=2mn=2m, Ξ³(X0,X1,⋯ ,Xmβˆ’1)\gamma(X_0,X_1,\cdots, X_{m-1}) is any rotation symmetric polynomial, and m/gcd(m,t)m/gcd(m,t) is odd. The class (i) of rotation symmetric bent functions has algebraic degree ranging from 2 to mm and the other class (ii) has algebraic degree ranging from 3 to mm

    Affine equivalence for quadratic rotation symmetric Boolean functions

    Full text link
    Let fn(x0,x1,…,xnβˆ’1)f_n(x_0, x_1, \ldots, x_{n-1}) denote the algebraic normal form (polynomial form) of a rotation symmetric (RS) Boolean function of degree dd in nβ‰₯dn \geq d variables and let wt(fn)wt(f_n) denote the Hamming weight of this function. Let (0,a1,…,adβˆ’1)n(0, a_1, \ldots, a_{d-1})_n denote the function fnf_n of degree dd in nn variables generated by the monomial x0xa1β‹―xadβˆ’1.x_0x_{a_1} \cdots x_{a_{d-1}}. Such a function fnf_n is called monomial rotation symmetric (MRS). It was proved in a 20122012 paper that for any MRS fnf_n with d=3,d=3, the sequence of weights {wk=wt(fk):Β k=3,4,…}\{w_k = wt(f_k):~k = 3, 4, \ldots\} satisfies a homogeneous linear recursion with integer coefficients. This result was gradually generalized in the following years, culminating around 20162016 with the proof that such recursions exist for any rotation symmetric function fn.f_n. Recursions for quadratic RS functions were not explicitly considered, since a 20092009 paper had already shown that the quadratic weights themselves could be given by an explicit formula. However, this formula is not easy to compute for a typical quadratic function. This paper shows that the weight recursions for the quadratic RS functions have an interesting special form which can be exploited to solve various problems about these functions, for example, deciding exactly which quadratic RS functions are balanced.Comment: 27 pages + references; minor typo correction
    corecore