Cryptology ePrint Archive: Report 2019/873

Count of rotational symmetric bent Boolean functions

Shashi Kant Pandey and P.R. Mishra

Abstract: Counting the Boolean functions having specific cryptographic features is an interesting problem in combinatorics and cryptography. Count of bent functions for more than eight variables is unexplored. In this paper, we propose an upper bound for the count of rotational symmetric bent Boolean functions and characterize its truth table representation from the necessary condition of a rotational symmetric bent Boolean function.

Category / Keywords: foundations / Rotational Symmetric Boolean Function, Algebraic Normal Form, Bent Boolean Function, Cryptography, Hamming Weight, Symmetric Boolean Function

Date: received 30 Jul 2019

Contact author: shashikantshvet at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20190801:132041 (All versions of this report)

Short URL: ia.cr/2019/873


[ Cryptology ePrint archive ]