Abstract
ABSTRACTIn this paper, we concentrate on the design of 1‐resilient Boolean functions with desirable cryptographic properties. Firstly, we put forward a novel secondary construction to obtain 1‐resilient functions. Next, we present the relationships between the properties of these constructed 1‐resilient functions and that of the initial functions. Based on the construction and a class of bent functions on n variables, we can obtain a class of (n + 3)‐variable 1‐resilient non‐separable cryptographic functions with a high algebraic immunity, whose nonlinearity is equal to the bent concatenation bound 2n + 2 − 2(n + 2)/2. Furthermore, we propose a set of 1‐resilient non‐separable functions on odd number of variables with an optimal algebraic degree, a high algebraic immunity, and a high nonlinearity. Copyright © 2011 John Wiley & Sons, Ltd.
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.
