Abstract
Permutation polynomials with low differential uniformity are important candidate functions to design substitution boxes of block ciphers. In this paper, we investigate several classes of differential 4-uniform binomial and trinomial permutation polynomials over the finite field [Formula: see text] of [Formula: see text] elements.
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: 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.
