Lower Bounds on the Algebraic Immunity of Boolean Functions
Chen, Hao · Li, Jianhua
Original · EN
From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of algebraic immunity (AI) was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symmetric Boolean functions and rotation symmetric Boolean functions. Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value n/2 are constructed.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.