J4 ›› 2009, Vol. 36 ›› Issue (5): 890-895.

• Original Articles • Previous Articles     Next Articles

Research on finding annihilators of Boolean functions based the algebraic normal form fast transformations

LIU Fu-yun;XIAO Hong;XIAO Guo-zhen   

  1. (State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an  710071, China)
  • Received:2009-02-09 Online:2009-10-20 Published:2009-11-30
  • Contact: LIU Fu-yun E-mail:liufuyun2008@sina.com

Abstract:

The algebraic normal form fast transfermations(ANFFTs) and computing methods are proposed by using the properties of Boolean Function's algebraic normal form, which has the smallest memory and higher efficiency. Under the previous assumption, two efficient algorithms for computing the annihilators of Boolean functions are presented. The first algorithm can be used to find the algebraic immunity of Boolean functions on n-variables and the algebraic normal form of the annihilators with the lowest algebraic degree. The second algorithm can be used to compute the algebraic immunity of a balanced Boolean functions on n-variables and its annihilators which have the algebraic degree≤d. Compared with the algorithms for computing the annihilators by solving linear congruential equations, these methods are highly operable and can be used to assess more effectively the resistance of Boolean functions against algebraic attacks.

Key words: algebraic attacks;Boolean functions;algebraic normal form fast transformations;annihilators;algebraic immunity

CLC Number: 

  • TN918.1