Abstract
We study permutation polynomials on F 2nwhich are associated with Kasami power functionsx d i.e. d = 22k — 2 k + 1 fork < nwith gcd(k, n) = 1. We describe in detail the equivalence of a class of permutation polynomials (say “Kasami” permutation polynomials), considered to derive the APN property of Kasami power functions, and the well-known class of MCM permutation polynomials. Explicit and recursive formulae for the polynomial representations of the inverses of Kasami and MCM permutation polynomials are given. As an application the imageBunder the two-to-one mapping (x + 1) d + x d + 1 can be characterized by a trace condition, and the 2-rank ofB* = B\{0}can be determined. We conjecture thatB*is a cyclic difference set, or in other terms that the characteristic sequence ofL \ Bhas ideal autocorrelation. (This conjecture has recently been confirmed, see “Notes added in proof”.)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
