Covering sequences of Boolean functions and their cryptographic significance
type: Item
instance of: scholarly article
title: Covering sequences of Boolean functions and their cryptographic significance
zbMATH Open document ID: 1035.94009
DOI: 10.1023/A:1014935513734
author: Yanyan Li
published in: Designs, Codes and Cryptography
publication date: 2003-03-19T00:00:00Z
review text: Balancedness, correlation-immunity with high order (resiliency), high nonlinearity, and high algebraic degree are desirable features of Boolean functions for applications in cryptography. Some of these features cannot be obtained simultaneously, and a trade-off is necessary. The authors introduce the notion of covering sequence of a Boolean function, characterise balancedness and correlation immunity by means of their covering sequences, and derive upper bounds on the algebraic degree and nonlinearity of subclasses of resilient functions by considering particular covering sequences. They give constructions of resilient functions of these subclasses and show that they achieve the best known trade-off between order of resiliency, nonlinearity, and algebraic degree.
reviewed by: Arne Winterhof
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 11T23
zbMATH DE Number: 1884812
zbMATH Keywords: Boolean functions
zbMATH Keywords: resilient functions
zbMATH Keywords: nonlinearity
zbMATH Keywords: algebraic degree
zbMATH Keywords: stream ciphers
MaRDI profile type: Publication
full work available at URL: a:1014935513734
OpenAlex ID: W1535052429
description: scientific article; zbMATH DE number 1884812