共查询到20条相似文献,搜索用时 484 毫秒
1.
We consider four classes of polynomials over the fields , , , , , , , where . We find sufficient conditions on the pairs for which these polynomials permute and we give lower bounds on the number of such pairs. 相似文献
2.
《Discrete Mathematics》2022,345(10):113000
Let be a finite field with elements and , where n, m and k are positive integers with and . In this paper, motivated by a recent work of Li, Xiong and Zeng (Li et al. (2021) [12]), we further study the boomerang uniformity of by using similar ideas and carrying out particular techniques in solving equations over finite fields. As a consequence, we generalize Li, Xiong and Zeng's result from the case of m being odd and to that of both and being odd. 相似文献
3.
In this paper, we completely determine all necessary and sufficient conditions such that the polynomial , where , is a permutation quadrinomial of over any finite field of odd characteristic. This quadrinomial has been studied first in [25] by Tu, Zeng and Helleseth, later in [24] Tu, Liu and Zeng revisited these quadrinomials and they proposed a more comprehensive characterization of the coefficients that results with new permutation quadrinomials, where and finally, in [16], Li, Qu, Li and Chen proved that the sufficient condition given in [24] is also necessary and thus completed the solution in even characteristic case. In [6] Gupta studied the permutation properties of the polynomial , where and and proposed some new classes of permutation quadrinomials of .In particular, in this paper we classify all permutation polynomials of of the form , where , over all finite fields of odd characteristic and obtain several new classes of such permutation quadrinomials. 相似文献
4.
5.
《Discrete Mathematics》2021,344(12):112616
Substitution boxes (S-boxes) play a central role in block ciphers. In substitution-permutation networks, the S-boxes should be permutation functions over to realize the invertibility of the encryption. More importantly, the S-boxes should have low differential uniformity, high nonlinearity, and high algebraic degree in order to resist differential attacks, linear attacks, and higher order differential attacks, respectively. In this paper, we construct new classes of differentially 4 and 6-uniform permutations by modifying the image of the Dobbertin APN function with over a subfield of . In addition, the algebraic degree and the lower bound of the nonlinearity of the constructed functions are given. 相似文献
6.
7.
9.
10.
11.
12.
13.
14.
15.
16.
In this paper, we study the long-time behavior of solutions of a reaction–diffusion model in a one-dimensional river network, where the river network has two branches, and the water flow speeds in each branch are the same constant . We show the existence of two critical values and 2 with , and prove that when , the population density in every branch of the river goes to 1 as time goes to infinity; when , then, as time goes to infinity, the population density in every river branch converges to a positive steady state strictly below 1; when , the species will be washed down the stream, and so locally the population density converges to 0. Our result indicates that only if the water-flow speed is suitably small (i.e., ), the species will survive in the long run. 相似文献
17.
18.
In this paper we analyze the intersection between the norm-trace curve over and the curves of the form , giving a complete characterization of the intersection between the curve and the parabolas (a=0), as well as sharp bounds for the other cases. This information is used for the determination of the weight distribution of some one-point AG codes arising from the curve. 相似文献