A sufficient and necessary condition of judging the independence of Boolean functions system

摘要

In ref, [1], the notation of the independence of Boolean functions system is defined, the properties and constructive methods of independent and balanced Boolean functions system are discussed, and its application in cryptology is described. A method judging the independence of balanced Boolean functions system is introduced, which will reduce the independent problem of judging balanced Boolean functions system to the balanced problem of .judging Boolean functions. This is very efficient in some situations. A permutation may be regarded as a special kind of independent and balanced Boolean functions system. The main results of refs. [2] and [3] are easily derived from the results in this note. Our results may be generalized to residue rings and any finite field, and bring more convenience for the discussion of independence, balance and orthogonality of functions system over residue rings and any finite field.