Abstract: Two Boolean functions defined on the same domain may have veriety of relationships. This paper studies their statistical independence, which is useful in the construction of Boolean permutations. This paper gives a necessary and sufficient condition for j

Key words: Cryptography, Boolean function, Statistical independence