We introduce the concepts of weighted ambiguity and deficiency for a mapping between two finite Abelian groups of the same size. Then we study the optimum lower bounds of these measures for a permutation of ℤn and give a construction of permutations meeting the lower bound by modifying some permutation polynomials over finite fields. These permutations are also APN permutations.

Additional Metadata
Persistent URL dx.doi.org/10.1007/978-3-642-12200-2_35
Series Lecture Notes in Computer Science
Citation
Panario, D. (Daniel), Stevens, B, & Wang, Q. (2010). Ambiguity and deficiency in Costas arrays and APN permutations. In Lecture Notes in Computer Science. doi:10.1007/978-3-642-12200-2_35