We study PN and APN functions over the integers modulo n. We give some construction techniques ba... more We study PN and APN functions over the integers modulo n. We give some construction techniques based on Costas arrays, which allow us to construct APN permutations on Z p−1 where p is a prime. Although PN permutations do not exist, one set of our functions is very close to being a set of PN permutations.
We study PN and APN functions over the integers modulo n. We give some construction techniques ba... more We study PN and APN functions over the integers modulo n. We give some construction techniques based on Costas arrays, which allow us to construct APN permutations on Z p−1 where p is a prime. Although PN permutations do not exist, one set of our functions is very close to being a set of PN permutations.
Uploads
Papers by Gary McGuire