More About the Corpus of Involutions From Two-to-One Mappings and Related Cryptographic S-Boxes

Permutation polynomials have been extensively studied for their applications in cryptography, coding theory, combinatorial design, etc. An important subfamily of permutations is the class of involutions (those permutations are equal to their compositional inverse). Elements of this class have been u...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on information theory Ročník 69; číslo 2; s. 1315 - 1327
Hlavní autoři:	Mesnager, Sihem, Yuan, Mu, Zheng, Dabin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.02.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Boolean functions Ciphers Codes Coding Coding theory Combinatorial analysis Cryptography Dickson polynomial differentially 4-uniform Encryption Fields (mathematics) Fixed points (mathematics) graph indicator involution Mathematical analysis Mathematics permutation polynomial Permutations Polynomials Resists resultant S-box Systematics two-to-one mapping Vectorial function
ISSN:	0018-9448, 1557-9654
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!