Journal on Communications ›› 2016, Vol. 37 ›› Issue (10): 92-98.doi: 10.11959/j.issn.1000-436x.2016200

• Papers • Previous Articles     Next Articles

New bound of algebraic immunity of a class of Boolean function

Ye TIAN1,Yu-qing ZHANG1,2,Yu-pu HU1,Gao-fei WU1   

  1. 1 State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China
    2 National Computer Network Intrusion Protection Center,University of Chinese Academy of Sciences,Beijing 101408,China
  • Online:2016-10-25 Published:2016-10-25
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Key Research and Development Project;The National Information Security Special Projects of National Development,The Reform Commission of China;China 111 Project

Abstract:

Algebraic immunity quantified the resistance of a Boolean function to the algebraic attack.Recently,Mesnager,et al showed that there were direct linked between the annihilators used in algebraic attacks and the coding theory.They showed that the lower bound of the algebraic immunity of Boolean functions could been derived from the minimum distance of the associated cyclic codes.An open problem proposed by Mesnager is settled with a detailed proof.Also,a lower bound of algebraic immunity of a class of Boolean functions will be introduced.

Key words: cryptography, Boolean functions, annihilators, algebraic immunity, cyclic code, minimum distance

No Suggested Reading articles found!