On propagation characteristics of resilient functions

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

Abstract

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.

Detaljer

Författare
  • P Charpin
  • Enes Pasalic
Enheter & grupper
Forskningsområden

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Elektroteknik och elektronik

Nyckelord

Originalspråkengelska
Titel på värdpublikationLecture Notes in Computer Science (Selected Areas in Cryptography. Revised Papers)
FörlagSpringer
Sidor175-195
Volym2595
StatusPublished - 2003
PublikationskategoriForskning
Peer review utfördJa
Evenemang9th Annual International Workshop, SAC 2002 - St. John's, Newfoundland, Kanada
Varaktighet: 2002 aug 152002 aug 16

Publikationsserier

Namn
Volym2595
ISSN (tryckt)0302-9743
ISSN (elektroniskt)1611-3349

Konferens

Konferens9th Annual International Workshop, SAC 2002
LandKanada
OrtSt. John's, Newfoundland
Period2002/08/152002/08/16