Degree optimized resilient Boolean functions from Maiorana-McFarland class

7Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present a construction method of degree optimized resilient Boolean functions with very high nonlinearity. We present a general construction method valid for any n ≥ 4 and for order of resiliency t satisfying t ≤ n - 3. The construction is based on the modification of the famous Marioana-McFarland class in a controlled manner such that the resulting functions will contain some extra terms of high algebraic degree in its ANF including one term of highest algebraic degree. Hence, the linear complexity is increased, the functions obtained reach the Siegentheler's bound and furthermore the nonlinearity of such a function in many cases is superior to all previously known construction methods. This construction method is then generalized to the case of vectorial resilient functions, that is {F} : double-struck F sign2n → double-struck F sign2m, providing functions of very high algebraic degree almost reaching the Siegenthaler's upper bound. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Pasalic, E. (2003). Degree optimized resilient Boolean functions from Maiorana-McFarland class. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2898, 93–114. https://doi.org/10.1007/978-3-540-40974-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free