Crooked binomials

Authors

Jürgen Bierbrauer, Michigan Technological UniversityFollow
Gohar M. Kyureghyan, Otto von Guericke University of Magdeburg

Document Type

Article

Publication Date

3-2008

Department

Department of Mathematical Sciences

Abstract

A function f : GF(2 r ) → GF(2 r ) is called crooked if the sets {f(x) + f(x + a)|x ∈ GF(2 r )} is an affine hyperplane for any nonzero a ∈ GF(2 r ). We prove that a crooked binomial function f(x) = x d + ux e defined on GF(2 r ) satisfies that both exponents d, e have 2-weights at most 2.

Publication Title

Designs, Codes, and Cryptography

Recommended Citation

Bierbrauer, J., & Kyureghyan, G. (2008). Crooked binomials. Designs, Codes, and Cryptography, 46(3), 269-301. http://doi.org/10.1007/s10623-007-9157-3
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4872