Count of rotational symmetric bent Boolean functions

Shashi Kant Pandey; P. R.  Mishra

Paper 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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint. MINOR revision.
Keywords: Rotational Symmetric Boolean Function Algebraic Normal Form Bent Boolean Function Cryptography Hamming Weight Symmetric Boolean Function
Contact author(s): shashikantshvet @ gmail com
History: 2019-08-01: received
Short URL: https://ia.cr/2019/873
License: CC BY

BibTeX

@misc{cryptoeprint:2019/873,
      author = {Shashi Kant Pandey and P. R.  Mishra},
      title = {Count of rotational symmetric bent Boolean functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/873},
      year = {2019},
      url = {https://eprint.iacr.org/2019/873}
}