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.
Shanqi PANG
Henan Normal University
Miao FENG
Henan Normal University
Xunan WANG
Henan Normal University
Jing WANG
Henan Normal University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shanqi PANG, Miao FENG, Xunan WANG, Jing WANG, "Construction of Permutations and Bent Functions" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 3, pp. 604-607, March 2018, doi: 10.1587/transfun.E101.A.604.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.604/_p
Copy
@ARTICLE{e101-a_3_604,
author={Shanqi PANG, Miao FENG, Xunan WANG, Jing WANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Construction of Permutations and Bent Functions},
year={2018},
volume={E101-A},
number={3},
pages={604-607},
abstract={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.},
keywords={},
doi={10.1587/transfun.E101.A.604},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Construction of Permutations and Bent Functions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 604
EP - 607
AU - Shanqi PANG
AU - Miao FENG
AU - Xunan WANG
AU - Jing WANG
PY - 2018
DO - 10.1587/transfun.E101.A.604
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2018
AB - 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.
ER -