Welcome to the resource topic for 2019/873
Title:
Count of rotational symmetric bent Boolean functions
Authors: Shashi Kant Pandey, 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.
ePrint: https://eprint.iacr.org/2019/873
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .