Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On $q$-nearly bent Boolean functions (1905.00150v1)

Published 1 May 2019 in math.CO and cs.CR

Abstract: For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $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.

Citations (1)

Summary

We haven't generated a summary for this paper yet.