Nonlinearity Computation for Sparse Boolean Functions

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	arXiv.org (May 3, 2013), p. n/a
1. Verfasser:	Çalık, Çağdaş
Veröffentlicht:	Cornell University Library, arXiv.org
Schlagworte:	Mathematical programming Integer programming Algorithms Computation Boolean functions Boolean algebra Walsh transforms Weight Linear functions Nonlinearity
Online-Zugang:	Citation/Abstract Full text outside of ProQuest
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!

Beschreibung
Abstract:	An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the distances to linear functions is obtained. The special structure of these distances can be exploited to reduce the task of nonlinearity computation to solving an associated binary integer programming problem. The proposed algorithm can be used in cases where applying the Fast Walsh transform is infeasible, typically when the number of input variables exceeds 40.
ISSN:	2331-8422
Quelle:	Engineering Database