%0 Journal Article
%A LIU Shishi1
%A 2
%A ZHANG Fengrong1
%A 2
%A XIA Shixiong1
%A ZHOU Yong1
%T Constructions of Triples of Boolean Permutations
%D 2019
%R 10.3778/j.issn.1002-8331.1809-0074
%J Computer Engineering and Applications
%P 40-45
%V 55
%N 11
%X Boolean permutations and bent functions play an important role in cryptography. From a generalized method of constructing triples of Boolean permutations（these permutations can be used to construct bent functions） provided by Coulter and Mesnager, an equivalent method and an algorithm for constructing triples of Boolean permutation are presented. Furthermore, the interrelationships among three permutations are further studied. A necessary and sufficient condition for constructing triples of Boolean permutations is proposed, and a new algorithm for constructing Boolean permutation is provided. Finally, the properties of the bent functions which are constructed by using these triples of permutations are analyzed.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1809-0074