On Efficient Implementation of a Search Strategy for Rotation Symmetric Boolean Functions
Martin Hell, Alexander Maximov, Subhamoy Maitra · 2004
Abstract – The class of rotation symmetric Boolean functions (RSBF) is very rich in terms of cryptographically significant Boolean functions. It has been shown that the search space of such functions can be significantly reduced by using specific data structures — the matrices nA and nB. In this paper we have shown an efficient implementation of the search strategy based on nA and nB. In particular, it allowed us to reduce the search time of (9,3,5,240) and [9,3,5,240] functions from 3 years to just a few days. 1