New bent functions from permutations and linear translators

2017-04-12
MESNAGER, sihem
ONGAN, pınar
Özbudak, Ferruh
Starting from the secondary construction originally introduced by Carlet ["On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities", Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 2006], that we shall call "Carlet` ssecondary construction", Mesnager has showed how one can construct several new primary constructions of bent functions. In particular, she has showed that three tuples of permutations over the finite field F2m such that the inverse of their sum equals the sum of their inverses give rise to a construction of a bent function given with its dual. It is not quite easy to find permutations satisfying such a strong condition (Am). Nevertheless, Mesnager has derived several candidates of such permutations in 2015, and showed in 2016 that in the case of involutions, the problem of construction of bent functions amounts to solve arithmetical and algebraic problems over finite fields. This paper is in the line of those previous works. We present new families of permutations satisfying (Am) as well as new infinite families of permutations constructed from permutations in both lower and higher dimensions. Our results involve linear translators and give rise to new primary constructions of bent functions given with their dual. And also, we show that our new families are not in the class of Maiorana-McFarland in general.

Suggestions

Characterisation and enumeration of a class of semi bent quadratic Boolean functions
KOÇAK, Neşe; Koçak, Onur Ozan; Özbudak, Ferruh; SAYGI, ZÜLFÜKAR (2015-01-01)
In this paper, we consider semi-bentness of quadratic Boolean functions defined for even n and give the characterisation of these functions. Up to our knowledge, semi-bentness of this class has not been investigated before and we proved that semi-bent functions of this form exist only for 6|n. Furthermore, we present a method for enumeration of semi-bent and bent functions in certain classes. Using this method we find the exact number of semi-bent functions of this form. Moreover, we complete some previous ...
On plateaued functions, linear structures and permutation polynomials
Mesnager, Sihem; Kaytancı, Kübra; Özbudak, Ferruh (2019-01-01)
We obtain concrete upper bounds on the algebraic immunity of a class of highly nonlinear plateaued functions without linear structures than the one was given recently in 2017, Cusick. Moreover, we extend Cusick’s class to a much bigger explicit class and we show that our class has better algebraic immunity by an explicit example. We also give a new notion of linear translator, which includes the Frobenius linear translator given in 2018, Cepak, Pasalic and Muratović-Ribić as a special case. We find some app...
Studies on non-weakly regular bent functions and related structures
Pelen, Rumi Melih; Özbudak, Ferruh; Department of Mathematics (2020)
Interest in bent functions over finite fields arises both from mathematical theory and practical applications. There has been lots of literature addressing various properties of bent functions. They have a number of applications consisting of coding theory, cryptography, and sequence designs. They’re divided into four subclasses: regular bent functions that are contained within the class of weakly regular bent functions that are contained within the class of dual-bent functions. Additionally, there are non-...
Improved cost function in the design of Boolean functions satisfying multiple criteria
Kavut, S; Yucel, MD (2003-01-01)
We develop an improved cost function, to be used, in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonlinearity, low autocorrelation, balancedness, and high algebraic degree. Using this cost function that does not necessitate experimental search for parameter tuning, the annealing-based algorithm reaches the desired function profiles more rapidly. Some Boolean functions of eight and nine variables have been found, which are unatta...
Improved p-ary codes and sequence families from Galois rings
Ling, San; Özbudak, Ferruh (2005-01-01)
In this paper, a recent bound on some Weil-type exponential sums over Galois rings is used in the construction of codes and sequences. The bound on these type of exponential sums provides a lower bound for the minimum distance of a family of codes over F-p, mostly nonlinear, of length p(m+1) and size p(2) (.) p(m)((D-[D/p2])), where 1 <= D <= p(m/2). Several families of pairwise cyclically distinct p-ary sequences of period p(p(m) - 1) of low correlation are also constructed. They compare favorably with cer...
Citation Formats
s. MESNAGER, p. ONGAN, and F. Özbudak, “New bent functions from permutations and linear translators,” 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40578.