Publications

Abstract : Cryptographic applications require Boolean functions for introducing nonlinearity in the cryptosystem. A Boolean function is said to be dihedral symmetric Boolean function if it is invariant under the action of permutations of dihedral group of members to its input variables. In this paper we enumerate the homogeneous dihedral symmetric Boolean functions. The minimal and maximal distances from a given Boolean function to the set of all dihedral symmetric Boolean functions are found. We prove that the set of all dihedral symmetric Boolean functions are metrically regular. © 2018 Academic Press. All Rights Reserved.