Imagen de Portada

Nonlinearity Computation for Sparse Boolean Functions

Guardado en:
Publicado en:arXiv.org (May 3, 2013), p. n/a
Autor principal: Çalık, Çağdaş
Publicado:
Cornell University Library, arXiv.org
Materias:
Mathematical programming
Integer programming
Algorithms
Computation
Boolean functions
Boolean algebra
Walsh transforms
Weight
Linear functions
Nonlinearity
Acceso en línea:Citation/Abstract
Full text outside of ProQuest
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Resumen: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
Fuente:Engineering Database