Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms
Yongjuan Wang, Guangpu Gao, Qingjun Yuan · Security and Communication Networks · 2022
It has been proved that the set of rotation symmetric Boolean functions (RSBFs) is abundant in cryptographically strong functions with multiple criteria. In this study, we design two genetic algorithms and apply them to search for balanced RSBFs with high nonlinearity. The experimental results show that our methods can generate cryptographically strong Boolean functions with high nonlinearity, 1-resilient functions, and optimal algebraic immunity. It shows that these functions have superiority from the view point of practical application in cryptosystems compared with known ones which are obtained by other heuristics.