A note on generalized bent criteria for Boolean functions
Author
Gangopadhyay, Sugata
Pasalic, Enes
Stănică, Pantelimon
Date
2012Metadata
Show full item recordAbstract
In this paper, we consider the spectra of
Boolean functions with respect to the action of unitary transforms obtained by taking tensor products of the Hadamard kernel, denoted by H, and the nega–Hadamard kernel, denoted by N. The set of all such transforms is denoted by {H,N}n. A Boolean function
is said to be bent4 if its spectrum with respect to at least one unitary transform in {H,N}n is flat. We obtain a relationship between bent, semi–bent and bent4 functions,
which is a generalization of the relationship between bent and negabent Boolean functions proved by Parker and
Pott [cf. LNCS 4893 (2007), 9–23]. As a corollary to this result we prove that the maximum possible algebraic degree of a bent4 function on n variables is [n/2], and
hence solve an open problem posed by Riera and Parker [cf. IEEE-TIT 52:9 (2006), 4142–4159].
Description
The article of record as published may be found at http://dx.doi.org/10.1109/TIT.2012.2235908.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
Correlation immunity, avalanche features, and other cryptographic properties of generalized Boolean functions
Martinsen, Thor (Monterey, California: Naval Postgraduate School, 2017-09);This dissertation investigates correlation immunity, avalanche features, and the bent cryptographic properties for generalized Boolean functions defined on Vn with values in Zԛ. We extend the concept of correlation immunity ... -
Cryptographic Boolean functions with biased inputs
Gangopadhyay, Sugata; Gangopadhyay, Aditi Kar; Pollatos, Spyridon; Stănică, Pantelimon (2015-07-31);While performing cryptanalysis, it is of interest to approximate a Boolean function in n variables f : Fn → F2 by affine functions. Usually, it is assumed that all the input vectors to a Boolean function are equiprobable ... -
Root-Hadamard transforms and complementary sequences
Medina, Luis A.; Parker, Matthew G.; Riera, Constanza; Stănică, Pantelimon (Springer, 2019-07);In this paper we define a new transform on (generalized) Boolean functions, which generalizes the Walsh-Hadamard, nega-Hadamard, 2k-Hadamard, consta-Hadamard and all HN-transforms. We describe the behavior of what we call ...