Investigations of c-Differential Uniformity of Permutations with Carlitz Rank 3
Jaeseong Jeong, Namhun Koo, Soonhak Kwon

TL;DR
This paper studies the $c$-differential uniformity of permutations with low Carlitz rank, especially rank 3, demonstrating their potential for cryptographic resistance against differential attacks.
Contribution
It establishes that permutations with low Carlitz rank, particularly rank 3, have low $c$-differential uniformity, advancing understanding of their cryptographic suitability.
Findings
Permutations with low Carlitz rank exhibit low $c$-differential uniformity.
Detailed analysis of Carlitz rank 3 permutations shows favorable cryptographic properties.
Results support using low Carlitz rank permutations in cryptographic functions.
Abstract
The -differential uniformity is recently proposed to reflect resistance against some variants of differential attack. Finding functions with low -differential uniformity is attracting attention from many researchers. For even characteristic, it is known that permutations of low Carlitz rank have good cryptographic parameters, for example, low differential uniformity, high nonlinearity, etc. In this paper we show that permutations with low Carlitz rank have low -differential uniformity. We also investigate -differential uniformity of permutations with Carlitz rank 3 in detail.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Algebraic structures and combinatorial models
