CRMay 25, 2013
A remark on algebraic immunity of Boolean functions
arXiv:1305.5919v1
Originality Synthesis-oriented
AI Analysis
This work clarifies a theoretical issue in cryptography, but it is incremental as it refines existing definitions without introducing new methods or broad applications.
The authors addressed confusion in the proof of optimal algebraic immunity for the Carlet-Feng function and similar constructions by proposing an equivalent definition of algebraic immunity for Boolean functions.
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.