On the equation \(x^{2^l+1}+x+a=0\) over \(\mathrm{GF}(2^k)\)

From MaRDI portal
Publication:2469479

DOI10.1016/j.ffa.2007.09.009zbMath1130.11072OpenAlexW2024385954MaRDI QIDQ2469479

Alexander Kholosha, Tor Helleseth

Publication date: 6 February 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2007.09.009




Related Items

Classification of fractional projective permutations over finite fields\(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))On a conjecture of differentially 8-uniform power functionsThe number of almost perfect nonlinear functions grows exponentiallyIf a generalised butterfly is APN then it operates on 6 bitsOn permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearityMore differentially 6-uniform power functionsOn the Walsh spectrum of a family of quadratic APN functions with five termsTwo classes of permutation trinomials over \(\mathbb{F}_{q^3}\) in characteristic twoDifference sets and three-weight linear codes from trinomialsRoots of certain polynomials over finite fieldsCompletely characterizing a class of permutation quadrinomialsInfinite families of 3‐designs from APN functionsOn a class of quadratic polynomials with no zeros and its application to APN functionsExtending two families of bivariate APN functionsFactorization of a class of polynomials over finite fieldsComplete solution over \(\mathbb{F}_{p^n}\) of the equation \(X^{p^k+1}+X+a=0\)Constructions of negabent functions over finite fieldsSolving \(X^{q+1}+X+a=0\) over finite fieldsAlmost perfect nonlinear trinomials and hexanomialsm-Sequences of Lengths 22k − 1 and 2 k  − 1 with at Most Four-Valued Cross CorrelationOn the iterations of the maps \(ax^{2^k}+b\) and \((a x^{2^k} + b)^{-1}\) over finite fields of characteristic twoOn decoding additive generalized twisted Gabidulin codesThe \(c\)-differential behavior of the inverse function under the \textit{EA}-equivalenceSolving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)On some quadratic APN functionsA note on ``Cryptographically strong permutations from the butterfly structure



Cites Work