Abstract
Rotation symmetric Boolean functions (RSBFs), which are invariant under circular translations, have been used as components of some different cryptosystems. In this paper, we study the constructions of even-variable RSBFs with maximum algebraic immunity (AI). First, we present a new construction class of even-variable RSBFs with maximum AI, which has totally n / 2 − 1 different constructions. And then in order to get even-variable RSBFs which achieve both maximum AI and high nonlinearity, an improved construction is proposed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
