Compositions and parities of complete mappings and of orthomorphisms

DOI10.1016/j.jcta.2022.105723OpenAlexW4320477443MaRDI QIDQ2689003

Yanyan Li

Publication date: 6 March 2023

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.09642

zbMATH Keywords

finite groupsLatin squarescryptographysymmetric groupalternating groupprimitive groupsorthomorphismscomplete mappingsround functionsharmonious groups

Mathematics Subject Classification ID

Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Abstract finite groups (20D99) Permutation groups (20B99)

Uses Software

• GAP
• FOX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle structures of orthomorphisms extending partial orthomorphisms of Boolean groups
• Some classes of monomial complete permutation polynomials over finite fields of characteristic two
• Parity types, cycle structures and autotopisms of Latin squares
• Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
• Complete permutation polynomials over finite fields of odd characteristic
• The group generated by the round functions of a GOST-like cipher
• Orthogonal Latin squares based on groups
• An application of the O'Nan-Scott theorem to the group generated by the round functions of an AES-like cipher
• Generalized complete mappings, neofields, sequenceable groups and block designs. I
• On some block ciphers and imprimitive groups
• Group theoretic properties of Rijndael-like ciphers
• Reduction of the Hall-Paige conjecture to sporadic simple groups.
• Is the data encryption standard a group? (Results of cycling experiments on DES)
• Groups of permutation polynomials over finite fields
• A weak cipher that generates the symmetric group
• Parity of sets of mutually orthogonal Latin squares
• Block substitutions using orthomorphic mappings
• Permutations of finite fields for check digit systems
• On invariant subspaces in the Lai-Massey scheme and a primitivity reduction
• Coset-wise affine functions and cycle types of complete mappings
• The round functions of KASUMI generate the alternating group
• The Hall-Paige conjecture, and synchronization for affine and diagonal groups
• The spectrum of group-based complete Latin squares
• Complete mappings and Carlitz rank
• Several classes of complete permutation polynomials
• On the group generated by the round functions of translation based ciphers over arbitrary finite fields
• A note on complete polynomials over finite fields and their applications in cryptography
• Generalizations of complete mappings of finite fields and some applications
• The admissibility of sporadic simple groups.
• Sequenceable groups and related topics.
• Harmonious groups
• An asymptotic for the Hall-Paige conjecture
• Combinatorics of Permutations
• Loiss: A Byte-Oriented Stream Cipher
• A Remark on Stirling's Formula
• DES-like functions can generate the alternating group
• On the orders of Primitive Permutation Groups
• Generators for Certain Alternating Groups with Applications to Cryptography
• Primitivity of PRESENT and other lightweight ciphers
• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• New Constructions of Complete Permutations
• Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
• Selected Areas in Cryptography
• A Remark on Infinite Groups
• The Construction of Orthogonal Latin Squares
• Complete mappings of finite groups
• Orthomorphism graphs of groups
• Complete mappings of finite groups

This page was built for publication: Compositions and parities of complete mappings and of orthomorphisms