Maximal complete permutations over \(\mathbb{F}_2^n \)

DOI10.3934/amc.2022058zbMath1522.11126OpenAlexW4287964885MaRDI QIDQ6112210

Bing Chen, Lisha Li, Xiangyong Zeng, Xiaofang Xu

Publication date: 7 July 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2022058

zbMATH Keywords

permutationBoolean functionlinear structuremaximal complete permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Polynomials over finite fields (11T06) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle structures of orthomorphisms extending partial orthomorphisms of Boolean groups
• The design of Rijndael. The Advanced Encryption Standard (AES)
• Permutation polynomials and applications to coding theory
• Partitions of groups and complete mappings
• Characterization of linear structures
• Block substitutions using orthomorphic mappings
• Several classes of complete permutation polynomials over finite fields of even characteristic
• A note on complete polynomials over finite fields and their applications in cryptography
• Orthomorphisms of Groups and Orthogonal Latin Squares. I
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• Quadratic permutations, complete mappings and mutually orthogonal latin squares
• Selected Areas in Cryptography
• The Construction of Orthogonal Latin Squares

This page was built for publication: Maximal complete permutations over \(\mathbb{F}_2^n \)