Hybrid classes of balanced Boolean functions with good cryptographic properties

Date

2014-07-20

Author

Khan, Mansoor Ahmed
Özbudak, Ferruh

Metadata

Show full item record

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

Item Usage Stats

22
views

0
downloads

Cryptographically strong Boolean functions play an imperative role in the design of almost every modern symmetric cipher. In this context, the cryptographic properties of Boolean functions, such as non-linearity, algebraic degree, correlation immunity and propagation criteria, are critically considered in the process of designing these ciphers. More recently, with the emergence of algebraic and fast algebraic attacks, algebraic immunity has also been included as an integral property to be considered. As a result, several constructions of Boolean functions with high non-linearity, maximal algebraic degree and optimal algebraic immunity have been devised since then. This paper focuses on some of these constructions and presents two hybrid classes of Boolean functions. The functions constructed within these classes possess maximal algebraic degree for balanced functions, optimal algebraic immunity, high non-linearity and good resistance to algebraic and fast algebraic attacks. A hybrid class of 1-resilient functions has also been proposed that also possesses high algebraic degree, optimal algebraic immunity, high non-linearity and good resistance to algebraic and fast algebraic attacks. (c) 2014 Elsevier Inc. All rights reserved.

Subject Keywords

Boolean function, Symmetric cipher, Non-linearity, Algebraic degree, Algebraic immunity, Optimal algebraic immunity

URI

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

Journal

INFORMATION SCIENCES

DOI

https://doi.org/10.1016/j.ins.2014.02.157

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

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.
Construction of cryptographically strong boolean functions well suited for symmetric cryptosystems Ahmed Khan, Mansoor; Özbudak, Ferruh; Department of Cryptography (2013) Boolean functions are amongst the vital ingredients of any symmetric cryptosystem in order to implement principles of confusion and di usion. These are utilized as non-linear filtering functions or combiner functions in LFSR-based stream ciphers and as s-box component functions or non-linear encryption functions in Fiestel structure based block ciphers. Consequently, the cryptographic properties of Boolean functions are amongst the main contributors to the strength of these ciphers against cryptanalysis. Th...
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 ...
Generalized rotation symmetric and dihedral symmetric boolean functions - 9 variable boolean functions with nonlinearity 242 Kavut, Selcuk; Yucel, Melek Diker (2007-12-20) Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yucel. In this paper, we present several 9-variable Boolean functions having nonlinearity of 242, which we obtain by suitably generalizing the classes of RSBFs and Dihedral Symmetric Boolean Functions (DSBFs). These functions do not have any zero in the Walsh spectrum values, ...
Constructions of bent functions Sulak, Fatih; Doğanaksoy, Ali; Department of Cryptography (2006) In cryptography especially in block cipher design, Boolean functions are the basic elements. A cryptographic function should have high nonlinearity as it can be attacked by linear attack. In this thesis the highest possible nonlinear boolean functions in the even dimension, that is bent functions, basic properties and construction methods of bent functions are studied. Also normal bent functions and generalized bent functions are presented.

Citation Formats

M. A. Khan and F. Özbudak, “Hybrid classes of balanced Boolean functions with good cryptographic properties,” INFORMATION SCIENCES, pp. 319–328, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34731.