DocumentCode
1248079
Title
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
Author
Liu, Meicheng ; Lin, Dongdai ; Pei, Dingyi
Author_Institution
State Key Lab. of Inf. Security, Inst. of Software of Chinese Acad. of Sci., Beijing, China
Volume
57
Issue
7
fYear
2011
fDate
7/1/2011 12:00:00 AM
Firstpage
4817
Lastpage
4821
Abstract
In this correspondence, first we 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. Besides, we improve the relations between algebraic degree and algebraic immunity of symmetric Boolean functions.
Keywords
Boolean functions; cryptography; algebraic immunity; fast algebraic attacks; symmetric Boolean function decomposition; Artificial intelligence; Boolean functions; Complexity theory; Computer science; Cryptography; Software; Algebraic attacks; algebraic degree; algebraic immunity; stream cipher; symmetric Boolean function;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2011.2145690
Filename
5895076
Link To Document