Algorithms for rotation symmetric Boolean functions
type: Item
instance of: scholarly article
title: Algorithms for rotation symmetric Boolean functions
zbMATH Open document ID: 1358.94115
DOI: 10.1504/IJICOT.2014.066109
author: Subrata Das
author: Satrajit Ghosh
author: Parthasarathi Dasgupta
author: Samar Sensarma
published in: International Journal of Information and Coding Theory
publication date: 2015-11-03T00:00:00Z
review text: Summary: Rotation Symmetric Boolean Functions (RSBFs) are of immense importance as building blocks of cryptosystems. This class of Boolean functions is invariant under circular translation of indices. It is known that, for \(n\)-variable RSBF functions, the associated set of all possible input \(n\)-bit strings can be divided into a number of subsets (called \textit{partitions} or \textit{orbits}), where every element (\(n\)-bit string) of a subset can be obtained by simply rotating the string of bits of some other element of the same subset. In this paper, for a given value of \(n\), we propose algorithms for the generation of these partitions of all possible \(n\)-bit strings, each partition corresponding to a specific \(n\)-variable RSBF and its associated circular translations. These partitions can then be used to generate all possible \(n\)-variable RSBFs. The proposed algorithms are implemented for a maximum value of \(n\)= 41.
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6503842
zbMATH Keywords: algorithms
zbMATH Keywords: cryptography
zbMATH Keywords: symmetric Boolean functions
zbMATH Keywords: rotation symmetric Boolean functions
zbMATH Keywords: information coding
MaRDI profile type: Publication
full work available at URL: ijicot.2014.066109
OpenAlex ID: W2123300543
description: scientific article; zbMATH DE number 6503842