Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4582967 | Finite Fields and Their Applications | 2013 | 11 Pages |
Abstract
Permutations with low differential uniformity are widely used in cipher design. Recently, Bracken, Tan and Tan (2012) [5] presented a method to construct differentially 4-uniform permutations by changing certain conditions of known APN functions. They guessed that only two classes of existing quadratic APN functions have this property. They succeeded in proving one class and left the other one as an open problem. In this paper, with the help of a computer, those polynomials are proved to be differentially 4-uniform but may not be permutation polynomials, which give a negative answer to this problem.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Longjiang Qu, Hai Xiong, Chao Li,