Differential spectrum of some power functions in odd prime characteristic
نویسندگان
چکیده
Article history: Received 28 June 2012 Revised 2 December 2012 Accepted 10 January 2013 Available online 31 January 2013 Communicated by Gary McGuire
منابع مشابه
Differential Spectrum of Some Power Functions With Low Differential Uniformity
In this paper, for an odd prime p, the differential spectrum of the power function x pk+1 2 in Fpn is calculated. For an odd prime p such that p ≡ 3 mod 4 and odd n with k|n, the differential spectrum of the power function x pn+1 pk+1 + p n −1 2 in Fpn is also derived. From their differential spectrums, the differential uniformities of these two power functions are determined. We also find some...
متن کاملLinear Codes With Two or Three Weights From Some Functions With Low Walsh Spectrum in Odd Characteristic
Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights are obtained from some functions with low Walsh spectrum in odd characteristic. Numerical results show that some of the linear codes obtained are optimal or al...
متن کامل2-recognizability of the simple groups $B_n(3)$ and $C_n(3)$ by prime graph
Let $G$ be a finite group and let $GK(G)$ be the prime graph of $G$. We assume that $ngeqslant 5 $ is an odd number. In this paper, we show that the simple groups $B_n(3)$ and $C_n(3)$ are 2-recognizable by their prime graphs. As consequences of the result, the characterizability of the groups $B_n(3)$ and $C_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are ...
متن کاملComputing the Characteristic Polynomials of a Class of Hyperelliptic Curves for Cryptographic Applications
Hyperelliptic curves have been widely studied for cryptographic applications, and some special hyperelliptic curves are often considered to be used in practical cryptosystems. Computing Jacobian group orders is an important operation in constructing hyperelliptic curve cryptosystems, and the most common method used for the computation of Jacobian group orders is by computing the zeta functions ...
متن کامل2-quasirecognizability of the simple groups B_n(p) and C_n(p) by prime graph
Let G be a finite group and let $GK(G)$ be the prime graph of G. We assume that $n$ is an odd number. In this paper, we show that if $GK(G)=GK(B_n(p))$, where $ngeq 9$ and $pin {3,5,7}$, then G has a unique nonabelian composition factor isomorphic to $B_n(p)$ or $C_n(p)$ . As consequences of our result, $B_n(p)$ is quasirecognizable by its spectrum and also by a new proof, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 21 شماره
صفحات -
تاریخ انتشار 2013