On q-nearly bent Boolean functions

05/01/2019
by   Zhixiong Chen, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2017

On the q-Bentness of Boolean Functions

For each non-constant q in the set of n-variable Boolean functions, the ...
research
06/02/2019

New non-linearity parameters of Boolean functions

The study of non-linearity (linearity) of Boolean function was initiated...
research
09/28/2021

An Open Problem on the Bentness of Mesnager's Functions

Let n=2m. In the present paper, we study the binomial Boolean functions ...
research
07/22/2019

Root-Hadamard transforms and complementary sequences

In this paper we define a new transform on (generalized) Boolean functio...
research
04/15/2014

On the Role of Canonicity in Bottom-up Knowledge Compilation

We consider the problem of bottom-up compilation of knowledge bases, whi...
research
03/27/2020

Non-linearity of the Carlet-Feng function, and repartition of Gauss sums

The search for Boolean functions that can withstand the main crypyograph...
research
03/27/2013

Generalizing Fuzzy Logic Probabilistic Inferences

Linear representations for a subclass of boolean symmetric functions sel...

Please sign up or login with your details

Forgot password? Click here to reset