Algorithms for rotation symmetric Boolean functions

DOI10.1504/IJICOT.2014.066109MaRDI QIDQ887834zbMATH OpenOpenAlexFDO

Authors Subrata Das, Satrajit Ghosh, Parthasarathi Dasgupta, Samar Sensarma

Publication date 3 November 2015

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijicot.2014.066109

zbMATH Keywords

algorithmscryptographyinformation codingrotation symmetric Boolean functionssymmetric Boolean functions

Mathematics Subject Classification ID

Cryptography (94A60)

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.

Recommendations

• Rotation symmetric Boolean functions-count and cryptographic properties
• Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity
• Rotation symmetric logic formulas in quantitative logic
• New constructions of even-variable rotation symmetric Boolean functions with maximum algebraic immunity
• Secondary constructions of RSBFs with good cryptographic properties

Cited in

(7)

• Pivoting algorithms based on Boolean vector labeling
• On the matrix of rotation symmetric Boolean functions
• scientific article; zbMATH DE number 6718872 (Why is no real title available?)
• Rotation symmetric logic formulas in quantitative logic
• A fast algorithm for detecting rotation symmetric logical function with don't-care-terms
• The linear structures and fast points of rotation symmetric Boolean functions
• Rotation symmetric Boolean functions-count and cryptographic properties

This page was built for publication: Algorithms for rotation symmetric Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887834)