Some results concerning cryptographically significant mappings over GF(2n)

Abstract

In this paper we investigate the existence of permutation polynomials of the form F(x) = xd + L(x) over GF(2n), L being a linear polynomial. The results we derive have a certain impact on the long-term open problem on the nonexistence of APN permutations over GF(2n), when n is even. It is shown that certain choices of exponent d cannot yield APN… (More)
DOI: 10.1007/s10623-010-9365-0

Topics

  • Presentations referencing similar topics