期刊名称:International Journal of Security and Its Applications
印刷版ISSN:1738-9976
出版年度:2015
卷号:9
期号:2
页码:111-122
DOI:10.14257/ijsia.2015.9.2.11
出版社:SERSC
摘要:Algebraic immunity is a cryptographic criterion for Boolean functions used in cryptosystem to resist algebraic attacks. They usually should have high algebraic immunity. Chen proposed a first order recursive construction of Boolean functions and checked that they had optimum algebraic immunity for n<8.This paper gives a detail proof of having optimum algebraic and being balanced for all n>0.