Improved cost function in the design of Boolean functions satisfying multiple criteria

Date

2003-01-01

Author

Kavut, S
Yucel, MD

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

146
views

0
downloads

We develop an improved cost function, to be used, in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonlinearity, low autocorrelation, balancedness, and high algebraic degree. Using this cost function that does not necessitate experimental search for parameter tuning, the annealing-based algorithm reaches the desired function profiles more rapidly. Some Boolean functions of eight and nine variables have been found, which are unattained in the computer search based literature, in terms of joint optimization of nonlinearity and autocorrelation. Global characteristics of eight-variable Boolean functions generated by algebraic construction or computer search are compared with respect to the sum-of-squared-error in their squared spectra, which is also proportional to the sum-of-squared-errors in their autocorrelation function, the term 'error' denoting the deviation from bent function characteristics. Preliminary results consisting of cryptographically strong Boolean functions of nine, ten and eleven variables obtained using a three-stage optimization technique are also presented.

Subject Keywords

Autocorrelation, Walsh-Hadamard transforms, Nonlinearity, Bent Boolean functions, Simulated annealing

URI

https://hdl.handle.net/11511/65700

Journal

PROGRESS IN CRYPTOLOGY -INDOCRYPT 2003

DOI

https://doi.org/10.1007/978-3-540-24582-7_9

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

New bent functions from permutations and linear translators MESNAGER, sihem; ONGAN, pınar; Özbudak, Ferruh (2017-04-12) Starting from the secondary construction originally introduced by Carlet ["On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities", Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 2006], that we shall call "Carlet` ssecondary construction", Mesnager has showed how one can construct several new primary constructions of bent functions. In particular, she has showed that three tuples of permutations over the finite field F2m such that the inverse of their sum...
Improved state estimation for jump Markov linear systems Orguner, Umut; Demirekler, Mübeccel; Department of Electrical and Electronics Engineering (2005) This thesis presents a comprehensive example framework on how current multiple model state estimation algorithms for jump Markov linear systems can be improved. The possible improvements are categorized as: -Design of multiple model state estimation algorithms using new criteria. -Improvements obtained using existing multiple model state estimation algorithms. In the first category, risk-sensitive estimation is proposed for jump Markov linear systems. Two types of cost functions namely, the instantaneous an...
Efficient Surface Integral Equation Methods for the Analysis of Complex Metamaterial Structures Yla-Oijala, Pasi; Ergül, Özgür Salih; Gurel, Levent; Taskinen, Matti (2009-03-27) Two approaches, the multilevel fast multipole algorithm with sparse approximate inverse preconditioner and the surface equivalence principle algorithm, are applied to analyze complex three-dimensional metamaterial structures. The efficiency and performance of these methods are studied and discussed.
An evolutionary algorithm for multiple criteria problems Soylu, Banu; Köksalan, Murat; Department of Industrial Engineering (2007) In this thesis, we develop an evolutionary algorithm for approximating the Pareto frontier of multi-objective continuous and combinatorial optimization problems. The algorithm tries to evolve the population of solutions towards the Pareto frontier and distribute it over the frontier in order to maintain a well-spread representation. The fitness score of each solution is computed with a Tchebycheff distance function and non-dominating sorting approach. Each solution chooses its own favorable weights accordin...
Improvement in non-linearity of carlet-feng infinite class of boolean functions Khan, Mansoor Ahmed; Özbudak, Ferruh (2012-12-01) In this paper we present a Walsh spectrum based method derived from the genetic hill climbing algorithm to improve the non-linearity of functions belonging to Carlet-Feng infinite class of Boolean functions, without degrading other cryptographic properties they possess. We implement our modified algorithms to verify the results and also present a comparison of the resultant cryptographic properties with the original functions.

Citation Formats

S. Kavut and M. Yucel, “Improved cost function in the design of Boolean functions satisfying multiple criteria,” PROGRESS IN CRYPTOLOGY -INDOCRYPT 2003, pp. 121–134, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65700.