1 research outputs found

    On qq-nearly bent Boolean functions

    Full text link
    For each non-constant Boolean function qq, Klapper introduced the notion of qq-transforms of Boolean functions. The {\em qq-transform} of a Boolean function ff is related to the Hamming distances from ff to the functions obtainable from qq by nonsingular linear change of basis. In this work we discuss the existence of qq-nearly bent functions, a new family of Boolean functions characterized by the qq-transform. Let qq be a non-affine Boolean function. We prove that any balanced Boolean functions (linear or non-linear) are qq-nearly bent if qq has weight one, which gives a positive answer to an open question (whether there exist non-affine qq-nearly bent functions) proposed by Klapper. We also prove a necessary condition for checking when a function isn't qq-nearly bent
    corecore