Abstract: Boolean permutations have very important applications in cryptosystems.Two new methods for constructing Boolean permutations are proposed，and the enumeration problem of Boolean permutations constructed by these methods is solved.Furthermore，the new methods are compared with Wu，Xing，Wen，Kim et al’s methods.It is shown that new methods actually generalize relational conclusions in these references.

Key words: Boolean permutation, balanced function, construction, enumeration

摘要： 布尔置换在密码体制设计中有很重要的应用。给出了两种构造布尔置换的新方法，解决了这两种方法构造的布尔置换的计数问题。将这两种构造方法与武传坤、邢育森、温巧燕以及Kim等人的构造方法进行了比较，结果表明这两种构造方法实际上推广了这些文献中的结论。

关键词: 布尔置换, 平衡函数, 构造, 计数