Abstract
AbstractRotation symmetric Boolean functions have been extensively studied in the recent years because of their applications in cryptography. In this study, a novel method to construct p‐variable 1‐resilient rotation symmetric functions over GF(p) is proposed based on a Latin square with maximum cycle structure, which is not required to solve any equation system. And a lower bound on the number of p‐variable 1‐resilient rotation symmetric functions is given. At last, an equivalent characterization of p‐variable 1‐resilient rotation symmetric functions over GF(p) is demonstrated, as a direct corollary, the number of p‐variable 1‐resilient rotation symmetric functions is represented by all the solutions of the equation system. Copyright © 2017 John Wiley & Sons, Ltd.
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.
