Cryptology ePrint Archive: Report 2015/790

On weak and strong 2^k-bent Boolean functions

Pantelimon Stanica

Abstract: In this paper we introduce a sequence of discrete Fourier transforms and define new versions of bent functions, which we shall call (weak, strong) octa/hexa/2^k-bent functions. We investigate relationships between these classes and completely characterize the octabent and hexabent functions in terms of bent functions.

Category / Keywords: foundations /

Date: received 6 Aug 2015

Contact author: pstanica at nps edu

Available format(s): PDF | BibTeX Citation

Version: 20150810:142128 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]