| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419653 | Discrete Applied Mathematics | 2009 | 7 Pages |
Abstract
We study PN and APN functions over the integers modulo nn. We give some construction techniques based on Costas arrays, which allow us to construct APN permutations on Zp−1Zp−1 where pp is a prime. Although PN permutations do not exist, one set of our functions is very close to being a set of PN permutations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Konstantinos Drakakis, Rod Gow, Gary McGuire,