On propagation characteristics of resilient functions

P Charpin, Enes Pasalic

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

26 Citations (SciVal)


In this paper we derive several important results towards a better understanding of propagation characteristics of resilient Boolean functions. We first introduce a new upper bound on nonlinearity of a given resilient function depending on the propagation criterion. We later show that a large class of resilient functions admit a linear structure; more generally, we exhibit some divisibility properties concerning the Walsh-spectrum of the derivatives of any resilient function. We prove that, fixing the order of resiliency and the degree of propagation criterion, a high algebraic degree is a necessary condition for construction of functions with good autocorrelation properties. We conclude by a study of the main constructions of resilient functions. We notably show how to avoid linear structures when a linear concatenation is used and when the recursive construction introduced in [11] is chosen.
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (Selected Areas in Cryptography. Revised Papers)
Publication statusPublished - 2003
Event9th Annual International Workshop, SAC 2002 - St. John's, Newfoundland, Canada
Duration: 2002 Aug 152002 Aug 16

Publication series

ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th Annual International Workshop, SAC 2002
CitySt. John's, Newfoundland

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering


  • Boolean functions
  • linear space
  • resiliency
  • nonlinearity
  • propagation characteristics


Dive into the research topics of 'On propagation characteristics of resilient functions'. Together they form a unique fingerprint.

Cite this