Paper 2010/597
A New Class of Bent--Negabent Boolean Functions
Sugata Gangopadhyay and Ankita Chaturvedi
Abstract
In this paper we develop a technique of constructing bent--negabent Boolean functions by using complete mapping polynomials. Using this technique we demonstrate that for each $\ell \ge 2$ there exits bent--negabent functions on $n = 12\ell$ variables with algebraic degree $\frac{n}{4}+1 = 3\ell + 1$. It is also demonstrated that there exist bent--negabent functions on $8$ variables with algebraic degrees $2$, $3$ and $4$.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Boolean functionbent functionbent - negabent functionnega-Hadamard tranformcomplete mapping polynomial.
- Contact author(s)
- gsugata @ gmail com
- History
- 2010-12-22: revised
- 2010-11-24: received
- See all versions
- Short URL
- https://ia.cr/2010/597
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/597,
author = {Sugata Gangopadhyay and Ankita Chaturvedi},
title = {A New Class of Bent--Negabent Boolean Functions},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/597},
year = {2010},
url = {https://eprint.iacr.org/2010/597}
}
