For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Construction of Permutations and Bent Functions
Shanqi PANG Miao FENG Xunan WANG Jing WANG
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2018/03/01
Online ISSN: 1745-1337
Type of Manuscript: LETTER
Category: Cryptography and Information Security
bent functions, permutation, M-M function, Kronecker product,
Full Text: PDF(266KB)
>>Buy this Article
Bent functions have been applied to cryptography, spread spectrum, coding theory, and combinatorial design. Permutations play an important role in the design of cryptographic transformations such as block ciphers, hash functions and stream ciphers. By using the Kronecker product this paper presents a general recursive construction method of permutations over finite field. As applications of our method, several infinite classes of permutations are obtained. By means of the permutations obtained and M-M functions we construct several infinite families of bent functions.