Analysis of boolean functions with respect to Walsh spectrum

Download
index.pdf
2013
Uyan, Erdener
Show full item record
280
views
194
downloads
Boolean functions appear in various scientific disciplines including coding theory, combinatorics, complexity theory, cryptography, graph theory, etc. In cryptography, the design and analysis of Boolean functions possessing a range of cryptographic characteristics has often been the focus of attention. A productive ground of research for most of these cryptographic characteristics is Walsh spectrum, one of the most common representations of a Boolean function. This thesis presents an analysis of Boolean functions with respect to Walsh spectrum. The research is mainly devoted to the problem of determining the existence, construction and enumeration of n-variable Boolean functions having an arbitrary value, ?, appearing a certain number of times, s, in their Walsh spectrum. The thesis develops a new framework for the solution of this problem with parameters n, ? and s. Complete classification of Boolean functions of up to 6-variables is obtained within this framework. In higher dimensions, proof of existence by construction, several explicit formulas and bounds for various ? and s values are devised. On the other hand, the use of affine equivalence and the local connectivity is discussed. A new affine invariant property and an algorithm for computing the sizes of equivalence classes are introduced.
Boolean functions., Walsh spectrum., Affine equivalence., Cryptography.
http://etd.lib.metu.edu.tr/upload/12616246/index.pdf
https://hdl.handle.net/11511/22847
Graduate School of Applied Mathematics, Thesis

Suggestions

Characterizations of Partially Bent and Plateaued Functions over Finite Fields
Mesnager, Sihem; Özbudak, Ferruh; SINAK, AHMET (2018-12-30)
Partially bent and plateaued functions over finite fields have significant applications in cryptography, sequence theory, coding theory, design theory and combinatorics. They have been extensively studied due to their various desirable cryptographic properties. In this paper, we study on characterizations of partially bent and plateaued functions over finite fields, with the aim of clarifying their structure. We first redefine the notion of partially bent functions over any finite field Fq , with q a prim...
Computing cryptographic properties of Boolean functions from the algebraic normal orm representation
Çalık, Çağdaş; Doğanaksoy, Ali; Department of Cryptography (2013)
Boolean functions play an important role in the design and analysis of symmetric-key cryptosystems, as well as having applications in other fields such as coding theory. Boolean functions acting on large number of inputs introduces the problem of computing the cryptographic properties. Traditional methods of computing these properties involve transformations which require computation and memory resources exponential in the number of input variables. When the number of inputs is large, Boolean functions are ...
On nonlinearity and hamming weight preserving bijective mappings acting on boolean functions
Sertkaya, İsa; Doğanaksoy, Ali; Department of Cryptography (2014)
Boolean functions are widely studied in cryptography due to their key role and ap- plications in various cryptographic schemes. Particularly in order to make symmetric crypto-systems resistant against cryptanalytic attacks, Boolean functions are associ- ated some cryptographic design criteria. As a result of Shannon’s similarity of secrecy systems theory, cryptographic design criteria should be at least preserved under the action of basic transformations. Among these design criteria, Meier and Staffelbach a...
On q-ary plateaued functions over F-q and their explicit characterizations
Mesnager, Sihem; Özbudak, Ferruh; Sinak, Ahmet; Cohen, Gerard (Elsevier BV, 2019-08-01)
Plateaued and bent functions play a significant role in cryptography, sequence theory, coding theory and combinatorics. In 1997, Coulter and Matthews redefined bent functions over any finite field F-q where q is a prime power, and established their properties. The objective of this work is to redefine the notion of plateaued functions over F-q, and to present several explicit characterizations of those functions. We first give, over F-q, the notion of q-ary plateaued functions, which relies on the concept o...
On constructions and enumeration of bent and semi-bent functions
Koçak, Neşe; Doğanaksoy, Ali; Saygı, Zülfükar; Department of Cryptography (2015)
Bent and semi-bent functions play an important role in cryptography and coding theory. They are widely studied as parts of building blocks in symmetric key cryptosystems because they provide resistance to fast correlation attacks and linear cryptanalysis due to their high nonlinearity. Besides, they can possess other desirable cryptographic properties such as low autocorrelation, propagation criteria, resiliency and high algebraic degree. Therefore, parallel to the advances in cryptanalysis techniques, the ...
Citation Formats
E. Uyan, “Analysis of boolean functions with respect to Walsh spectrum,” Ph.D. - Doctoral Program, Middle East Technical University, 2013.
METU IIS - Integrated Information Service open@metu.edu.tr