首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 218 毫秒
1.
2.
3.
4.
Very recently, Tu et al. presented a sufficient condition on (a1,a2,a3), see Theorem 1.1, such that f(x)=x32m+a1x2m+1+1+a2x2m+2+a3x3 is a class of permutation polynomials over F2n with n=2m and m odd. In this present paper, we prove that the sufficient condition is also necessary.  相似文献   

5.
We consider four classes of polynomials over the fields Fq3, q=ph, p>3, f1(x)=xq2+q1+Axq2q+1+Bx, f2(x)=xq2+q1+Axq3q2+q+Bx, f3(x)=xq2+q1+Axq2Bx, f4(x)=xq2+q1+AxqBx, where A,BFq. We find sufficient conditions on the pairs (A,B) for which these polynomials permute Fq3 and we give lower bounds on the number of such pairs.  相似文献   

6.
《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 F2n 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 xd with d=24k+23k+22k+2k1 over a subfield of F2n. In addition, the algebraic degree and the lower bound of the nonlinearity of the constructed functions are given.  相似文献   

7.
8.
《Discrete Mathematics》2022,345(10):113000
Let F2n be a finite field with 2n elements and fc_(x)=c0x2m(2k+1)+c1x2m+k+1+c2x2m+2k+c3x2k+1F2n[x], where n, m and k are positive integers with n=2m and gcd?(m,k)=e. 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 fc_(x) 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 e=1 to that of both m/e and k/e being odd.  相似文献   

9.
In this paper, we completely determine all necessary and sufficient conditions such that the polynomial f(x)=x3+axq+2+bx2q+1+cx3q, where a,b,cFq, is a permutation quadrinomial of Fq2 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 char(Fq)=2 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 x3+axq+2+bx2q+1+cx3q, where char(Fq)=3,5 and a,b,cFq and proposed some new classes of permutation quadrinomials of Fq2.In particular, in this paper we classify all permutation polynomials of Fq2 of the form f(x)=x3+axq+2+bx2q+1+cx3q, where a,b,cFq, over all finite fields of odd characteristic and obtain several new classes of such permutation quadrinomials.  相似文献   

10.
11.
12.
13.
《Discrete Mathematics》2020,343(10):111996
A Gallai coloring of a complete graph Kn is an edge coloring without triangles colored with three different colors. A sequence e1ek of positive integers is an (n,k)-sequence if i=1kei=n2. An (n,k)-sequence is a G-sequence if there is a Gallai coloring of Kn with k colors such that there are ei edges of color i for all i,1ik. Gyárfás, Pálvölgyi, Patkós and Wales proved that for any integer k3 there exists an integer g(k) such that every (n,k)-sequence is a G-sequence if and only if ng(k). They showed that g(3)=5,g(4)=8 and 2k2g(k)8k2+1.We show that g(5)=10 and give almost matching lower and upper bounds for g(k) by showing that with suitable constants α,β>0, αk1.5lnkg(k)βk1.5 for all sufficiently large k.  相似文献   

14.
15.
In this paper we analyze the intersection between the norm-trace curve over Fq3 and the curves of the form y=ax3+bx2+cx+d, 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.  相似文献   

16.
17.
We study elliptic surfaces corresponding to an equation of the specific type y2=x3+f(t)x, defined over the finite field Fq for a prime power q3mod4. It is shown that if s4=f(t) defines a curve that is maximal over Fq2 then the rank of the group of sections defined over Fq on the elliptic surface is determined in terms of elementary properties of the rational function f(t). Similar results are shown for elliptic surfaces given by y2=x3+g(t) using prime powers q5mod6 and curves s6=g(t). Finally, for each of the forms used here, existence of curves with the property that they are maximal over Fq2 is discussed, as well as various examples.  相似文献   

18.
19.
20.
Let α and β be two permutations in Sn. We prove that if the commutator [α,β] has at least n?4 fixed points then there exists a permutation γSn such that αγ=α?1 and βγ=β?1. This gives an affirmative answer to a conjecture proposed by Danny Neftin, which leads to the completion of the classification of monodromy groups for sufficiently large degree.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号