The Cryptographic P-permutations based on Cyclic Codes

Abstract

The desired p-permutation to carefully design has yielded twice the result with half the effort
to resist the powerful differential and linear attacks to modern block cipher used widely. The
MDS code has been used to design a linear p-permutation with good features in the symmetric
cryptosystem. In this paper, a generation algorithm of linear p-permutations taken advantage of
the BCHcode and the Goppa code has generated the linear p-permutations that cryptographic
properties is designed according to the specified bound. Further, a creative algorithm to
generate the linear p-permutations is proposed, whose branch number is not smaller than an
early designation lower bound.