TY - JOUR AU - Huang, Chenfan AU - Xia, Shixiong AU - Zhang, Fengrong AU - Zhou, Yong PY - 2019/03/07 Y2 - 2024/03/28 TI - Constructions of Two Classes of Permutation Polynomials JF - IJRDO -Journal of Computer Science Engineering JA - cse VL - 5 IS - 3 SE - Articles DO - 10.53555/cse.v5i3.2729 UR - https://ijrdo.org/index.php/cse/article/view/2729 SP - 01-13 AB - In this paper, we first investigate the constructions of permutation polynomials of the shape  over. A mapping function which transforms a Boolean function on n variables to a univariate function over  is provided. On basis of the mapping function, we put forward two methods for constructing two classes of univariate functions over  . Further, two classes of permutation polynomials of the shape can be obtained using the two classes of univariate functions. At last, based on the one-to-one correspondence between Boolean permutations and Maiorana-McFarland’s (M-M) bent functions, we propose an algorithm to compute the algebraic normal form (ANF) of a 2k-variable M-M bent function from its truth-table. The complexity of this algorithm is much smaller than that of the Butterfly algorithm which is directly used to compute the ANF of a 2k-variable M-M bent function from its truth-table. ER -