Recursive construction method of Boolean permutations

This paper proposes a new recursive method for constructing (n + 1)-bit Boolean permutations from n-bit ones, and proves that all (n + 1)-bit Boolean permutations can be constructed by the method, thereby solving enumeration problem of the kind of Boolean permutations. Furthermore, Boolean permutations with good cryptographic properties can be constructed by adding some restrictive conditions to the method.