On the linear structures of Balanced functions and quadratic APN functions

09/25/2019
by   Augustine Musukwa, et al.
0

The set of linear structures of most known balanced Boolean functions is nontrivial. In this paper, some balanced Boolean functions whose set of linear structures is trivial are constructed. We show that any APN function in even dimension must have a component whose set of linear structures is trivial. We determine a general form for the number of bent components in quadratic APN functions in even dimension and some bounds on the number are produced. We also count bent components in any quadratic power functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2021

Trims and Extensions of Quadratic APN Functions

In this work, we study functions that can be obtained by restricting a v...
research
04/27/2023

Counting unate and balanced monotone Boolean functions

For n≤ 6, we provide the number of n-variable unate and monotone Boolean...
research
01/25/2022

Gold Functions and Switched Cube Functions Are Not 0-Extendable in Dimension n > 5

In the independent works by Kalgin and Idrisova and by Beierle, Leander ...
research
12/24/2021

Auto-balanced common shock claim models

The paper is concerned with common shock models of claim triangles. Thes...
research
09/15/2020

New Instances of Quadratic APN Functions

By applying a recursive tree search, we find many new instances of quadr...
research
05/25/2019

On constructions and properties of (n,m)-functions with maximal number of bent components

For any positive integers n=2k and m such that m≥ k, in this paper we sh...
research
10/13/2022

Improved Bounds on Neural Complexity for Representing Piecewise Linear Functions

A deep neural network using rectified linear units represents a continuo...

Please sign up or login with your details

Forgot password? Click here to reset