Crooked binomials
From MaRDI portal
Publication:1008984
DOI10.1007/s10623-007-9157-3zbMath1196.11162OpenAlexW2914450592MaRDI QIDQ1008984
Gohar M. Kyureghyan, Juergen Bierbrauer
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9157-3
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06)
Related Items (11)
The \textit{crooked} property ⋮ Componentwise APNness, Walsh uniformity of APN functions, and cyclic-additive difference sets ⋮ When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)? ⋮ On equivalence between known families of quadratic APN functions ⋮ Almost perfect and planar functions ⋮ Almost perfect nonlinear trinomials and hexanomials ⋮ New semifields, PN and APN functions ⋮ On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$ ⋮ A family of crooked functions ⋮ On the differential equivalence of APN functions ⋮ Exceptional crooked functions
Cites Work
- Unnamed Item
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Crooked functions, bent functions, and distance regular graphs
- A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters
- Codes, graphs, and schemes from nonlinear functions
- Crooked maps in \(\mathbb F_{2^n}\)
- A new APN function which is not equivalent to a power mapping
This page was built for publication: Crooked binomials
