Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
