Computer Science – Cryptography and Security
Scientific paper
2009-10-24
Computer Science
Cryptography and Security
13 pages, submitted to IEEE Transactions on Information Theory
Scientific paper
Algebraic and fast algebraic attacks are power tools to analyze stream ciphers. A class of symmetric Boolean functions with maximum algebraic immunity were found vulnerable to fast algebraic attacks at EUROCRYPT'06. Recently, the notion of AAR (algebraic attack resistant) functions was introduced as a unified measure of protection against both classical algebraic and fast algebraic attacks. In this correspondence, we first give a decomposition of symmetric Boolean functions, then we show that almost all symmetric Boolean functions, including these functions with good algebraic immunity, behave badly against fast algebraic attacks, and we also prove that no symmetric Boolean functions are AAR functions. Besides, we improve the relations between algebraic degree and algebraic immunity of symmetric Boolean functions.
Lin Dongdai
Liu Meicheng
No associations
LandOfFree
Fast Algebraic Attacks and Decomposition of Symmetric 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 Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-211651