A remark on algebraic immunity of Boolean functions
Baofeng Wu, Jia Zheng
TL;DR
This paper clarifies the concept of algebraic immunity in Boolean functions, providing an equivalent definition to resolve previous confusion and improve understanding of optimal immunity properties.
Contribution
It introduces an equivalent definition of algebraic immunity that clarifies existing ambiguities and enhances the analysis of Boolean functions' cryptographic strength.
Findings
Clarified the definition of algebraic immunity
Resolved confusion regarding optimal algebraic immunity
Provided insights into Boolean functions' cryptographic properties
Abstract
In this correspondence, an equivalent definition of algebraic immunity of Boolean functions is posed, which can clear up the confusion caused by the proof of optimal algebraic immunity of the Carlet-Feng function and some other functions constructed by virtue of Carlet and Feng's idea.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptographic Implementations and Security · graph theory and CDMA systems