Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms | Zendy

Yongjuan Wang | Zendy; Guangpu Gao | Zendy; Qingjun Yuan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms

Author(s) -

Yongjuan Wang,

Guangpu Gao,

Qingjun Yuan

Publication year - 2022

Publication title -

security and communication networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.446

H-Index - 43

eISSN - 1939-0114

pISSN - 1939-0122

DOI - 10.1155/2022/8188533

Subject(s) - boolean function , computer science , heuristic , boolean expression , heuristics , algorithm , rotation (mathematics) , cryptosystem , boolean circuit , nonlinear system , parity function , discrete mathematics , theoretical computer science , mathematics , cryptography , artificial intelligence , physics , quantum mechanics , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research