Boolean functions with excellent cryptographic properties in autocorrelation and walsh spectra

Download

index.pdf

Date

2008

Author

Kavut, Selçuk

Metadata

Show full item record

Item Usage Stats

252
views

125
downloads

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.

Subject Keywords

Electrical engineering., Telecommunication.

URI

http://etd.lib.metu.edu.tr/upload/3/12609795/index.pdf
https://hdl.handle.net/11511/17836

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Neural network based beamforming for linear and cylindrical array applications Güreken, Murat; Dural Ünver, Mevlüde Gülbin; Department of Electrical and Electronics Engineering (2009) In this thesis, a Neural Network (NN) based beamforming algorithm is proposed for real time target tracking problem. The algorithm is performed for two applications, linear and cylindrical arrays. The linear array application is implemented with equispaced omnidirectional sources. The influence of the number of antenna elements and the angular seperation between the incoming signals on the performance of the beamformer in the linear array beamformer is studied, and it is observed that the algorithm improves...
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...
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 ...
CBFEM-MPI: A Parallelized Version of Characteristic Basis Finite Element Method for Extraction of 3-D Interconnect Capacitances Ozgun, Ozlem; Mittra, Raj; Kuzuoğlu, Mustafa (Institute of Electrical and Electronics Engineers (IEEE), 2009-02-01) In this paper, we present a novel, non-iterative domain decomposition method, which has been parallelized by using the message passing interface (MPI) library, and used to efficiently extract the capacitance matrixes of 3-D interconnect structures, by employing characteristic basis functions (CBFs) in the context of the finite element method (FEM). In this method, which is Failed CBFEM-MPI, the computational domain is partitioned into a number of nonoverlapping subdomains in which the CBFs are constructed b...

Citation Formats

S. Kavut, “Boolean functions with excellent cryptographic properties in autocorrelation and walsh spectra,” Ph.D. - Doctoral Program, Middle East Technical University, 2008.