Lower Bounds on the Algebraic Immunity of Boolean Functions

Details Lower Bounds on the Algebraic Immunity of Boolean Functions Lower Bounds on the Algebraic Immunity of Boolean Functions

2006-08-19

arxiv.org/abs/cs/0608080v3

Computer Science

Cryptography and Security

Scientific paper

From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of {\em 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 $\lceil \frac{n}{2}\rceil$ are constructed.

Affiliated with

Also associated with

No associations

Rating

Lower Bounds on the Algebraic Immunity of Boolean Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower Bounds on the Algebraic Immunity of Boolean Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds on the Algebraic Immunity of Boolean Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-95177