Boolean functions with excellent cryptographic properties in autocorrelation and walsh spectra

Kavut, Selçuk
We introduce a steepest-descent-like search algorithm for the design of Boolean functions, yielding multiple desirable cryptographic properties in their Walsh and autocorrelation spectra together. The algorithm finds some Boolean functions on 9, 10, 11, 13 variables with very good cryptographic properties unattained in the literature. More specifically, we have discovered 9-variable rotation symmetric Boolean functions (RSBFs) having nonlinearity of 241, which exceeds the bent concatenation bound and has remained as an open question in the literature for almost three decades. We have then shown that there is no RSBF having nonlinearity greater than 241, and that there are 8x189 many RSBFs having nonlinearity of 241, such that, among them there are only two that are different up to the affine equivalence. We also propose a generalization to RSBFs and dihedral symmetric Boolean functions (DSBFs), which improves the nonlinearity result of 9-variable Boolean functions to 242. Further, we classify all possible permutations (362, 880) on the input variables of 9-variable Boolean functions and find that there are only 30 classes, which are different with respect to the linear equivalence of invariant Boolean functions under some permutations. Some of these classes and their subsets yield new 9-variable Boolean functions having the nonlinearity of 242 with different autocorrelation spectra from those of the Boolean functions found in generalized RSBF and DSBF classes. Moreover, we have attained 13-variable balanced Boolean functions having nonlinearity of 4036 which is greater than the bent concatenation bound of 4032, and improves the recent result of 4034.


Design and fpga implementation of an efficient deinterleaving algorithm
Olgun, Muhammet Ertuğ; Akar, Gözde; Department of Electrical and Electronics Engineering (2008)
In this work, a new deinterleaving algorithm that can be used as a part of an ESM system and its implementation by using an FPGA is studied. The function of the implemented algorithm is interpreting the complex electromagnetic military field in order to detect and determine different RADARs and their types by using incoming RADAR pulses and their PDWs. It is assumed that RADAR signals in the space are received clearly and PDW of each pulse is generated as an input to the implemented algorithm system. Cluste...
Higher order levelable mrf energy minimization via graph cuts
Karcı, Mehmet Haydar; Demirekler, Mübeccel; Department of Electrical and Electronics Engineering (2008)
A feature of minimizing images of a class of binary Markov random field energies is introduced and proved. Using this, the collection of minimizing images of levels of higher order, levelable MRF energies is shown to be a monotone collection. This implies that these images can be combined to give minimizing images of the MRF energy itself. Due to the recent developments, second and third order binary MRF energies of the mentioned class are known to be exactly minimized by maximum flow/minimum cut computatio...
Fpga implementation of jointly operating channel estimator and parallelized decoder
Kılcıoğlu, Çağlar; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2009)
In this thesis, implementation details of a joint channel estimator and parallelized decoder structure on an FPGA-based platform is considered. Turbo decoders are used for the decoding process in this structure. However, turbo decoders introduce large decoding latencies since they operate in an iterative manner. To overcome that problem, parallelization is applied to the turbo codes and the resulting parallel decodable turbo code (PDTC) structure is employed for coding. The performance of a PDTC decoder and...
Direction finding for coherent, cyclostationary signals via a uniform circular array
Atalay Çetinkaya, Burcu; Koç, Arzu; Department of Electrical and Electronics Engineering (2009)
In this thesis work, Cyclic Root MUSIC method is integrated with spatial smoothing and interpolation techniques to estimate the direction of arrivals of coherent,cyclostationary signals received via a Uniform Circular Array (UCA). Cyclic Root MUSIC and Conventional Root MUSIC algorithms are compared for various signal scenarios by computer simulations. A cyclostationary process is a random process with probabilistic parameters, such as the autocorrelation function, that vary periodically with time. Most of ...
Constructions of resilient boolean functions with maximum nonlinearity
Şahin, M. Özgür; Yücel, Melek D; Department of Electrical and Electronics Engineering (2005)
In this thesis, we work on the upper bound for nonlinearity of t-resilient Boolean functions given by Sarkar and Maitra, which is based on divisibility properties of spectral weights of resilient functions and study construction methods that achieve the upper bound. One of the construction methods, introduced by Maity and Johansson, starts with a bent function and complements some values of its truth table corresponding to a previously chosen set of inputs, S, which satisfies three criteria. In this thesis,...
Citation Formats
S. Kavut, “Boolean functions with excellent cryptographic properties in autocorrelation and walsh spectra,” Ph.D. - Doctoral Program, Middle East Technical University, 2008.