This paper design the P-permutation with cryptologic properties beyond certain bound based on BCH code and Goppa code, which is the generalization of the design method utilizing the maximum distance separable (MDS) code, and presents the novel algorithms to generate the P-permutations with the branch number no less than a preset low bound. The new generation algorithms provide a theoretical basis for automation design of the cryptosystem. This paper design the P-permutation with cryptologic properties beyond certain bound based on BCH code and Goppa code, and the is the generalization of the design method utilizing the maximum distance separable (MDS) code, and presents the novel algorithms to generate the P-permutations with the branch number no less than a preset low bound. The new generation algorithms provide a theoretical basis for automation design of the cryptosystem.