Computer Science – Discrete Mathematics
Scientific paper
2008-10-22
Computer Science
Discrete Mathematics
Extended version of the paper with the same title which earlier appeared in Finite Fields and their applications
Scientific paper
In this paper, the polynomials $P_a(x)=x^{2^l+1}+x+a$ with $a\in\mathrm{GF}(2^k)$ are studied. New criteria for the number of zeros of $P_a(x)$ in $\mathrm{GF}(2^k)$ are proved. In particular, a criterion for $P_a(x)$ to have exactly one zero in $\mathrm{GF}(2^k)$ when $\gcd(l,k)=1$ is formulated in terms of the values of permutation polynomials introduced by Dobbertin. We also study the affine polynomial $a^{2^l}x^{2^{2l}}+x^{2^l}+ax+1$ which is closely related to $P_a(x)$. In many cases, explicit expressions for calculating zeros of these polynomials are provided.
Helleseth Tor
Kholosha Alexander
No associations
LandOfFree
On the Equation $x^{2^l+1}+x+a=0$ over $\mathrm{GF}(2^k)$ (Extended Version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Equation $x^{2^l+1}+x+a=0$ over $\mathrm{GF}(2^k)$ (Extended Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Equation $x^{2^l+1}+x+a=0$ over $\mathrm{GF}(2^k)$ (Extended Version) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-416685