Shift-invariant permutations of $\mathbb F_2^n$ are particularly attractive in symmetric cryptography because of their regularity and implementation efficiency. Constructing such permutations with an explicit algebraic structure remains a challenging problem. In this paper, we study a family of shift-invariant transfor...
Cheng Lyu, Da-Bin Zheng, Yu-Cen Mu et al.· 0 citations
Linearized permutation polynomials over finite fields have important applications in coding theory, cryptography, and combinatorics. In this paper, we give an explicit description of the cycle structure of a general linearized permutation polynomial in terms of the Jordan blocks of its Dickson matrix, thereby providing...
Shift-invariant permutations of $\mathbb F_2^n$ are attractive in symmetric cryptography because of their regularity and implementation efficiency. Constructing such permutations with an explicit algebraic structure remains a challenging problem. In this paper, we study a family of shift-invariant transformations of $\...
Cheng Lyu, Da-Bin Zheng, Yu-Cen Mu et al.· 0 citations
The connection between coding theory and combinatorial $t$-designs is an important research topic at the intersection of coding theory and combinatorics. Let $q=p^m$, where $p$ is an odd prime and $m\geq 2$. In this paper, we investigate a class of linear codes $\mathcal{C}$ over $\mathbb{F}_{q^2}$ and their connection...
Shi-Yan Xiong, Xiao-Qiang Wang, Da-Bin Zheng et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
