Nonlinearity preserving post-transformations

Sertkaya, İsa
Boolean functions are accepted to be cryptographically strong if they satisfy some common pre-determined criteria. It is expected that any design criteria should remain invariant under a large group of transformations due to the theory of similarity of secrecy systems proposed by Shannon. One of the most important design criteria for cryptographically strong Boolean functions is the nonlinearity criterion. Meier and Staffelbach studied nonlinearity preserving transformations, by considering the invertible transformations acting on the arguments of Boolean functions, namely the pre-transformations. In this thesis, first, the results obtained by Meier and Staffelbach are presented. Then, the invertible transformations acting on the truth tables of Boolean functions, namely the post-transformations, are studied in order to determine whether they keep the nonlinearity criterion invariant. The equivalent counterparts of Meier and Staffelbach̕s results are obtained in terms of the post-transformations. In addition, the existence of nonlinearity preserving post-transformations, which are not equivalent to pre-transformations, is proved. The necessary and sufficient conditions for an affine post-transformation to preserve nonlinearity are proposed and proved. Moreover, the sufficient conditions for an non-affine post-transformation to keep nonlinearity invariant are proposed. Furthermore, it is proved that the smart hill climbing method, which is introduced to improve nonlinearity of Boolean functions by Millan et. al., is equivalent to applying a post-transformation to a single Boolean function. Finally, the necessary and sufficient condition for an affine pre-transformation to preserve the strict avalanche criterion is proposed and proved.


Aggregate codifferential method for nonsmooth DC optimization
Tor, Ali Hakan; Bagirov, Adil; Karasözen, Bülent (2014-03-15)
A new algorithm is developed based on the concept of codifferential for minimizing the difference of convex nonsmooth functions. Since the computation of the whole codifferential is not always possible, we use a fixed number of elements from the codifferential to compute the search directions. The convergence of the proposed algorithm is proved. The efficiency of the algorithm is demonstrated by comparing it with the subgradient, the truncated codifferential and the proximal bundle methods using nonsmooth o...
Noncomplex smooth 4-manifolds with Lefschetz fibrations
Korkmaz, Mustafa (2001-01-01)
For every integer g ≥ 2 there exist infinitely many pairwise nonhomeomorphic smooth 4-manifolds admitting genus-g Lefschetz fibration over S2 but not carrying any complex structure. This extends a recent result of Ozbagci and Stipsicz.
Characterisation and enumeration of a class of semi bent quadratic Boolean functions
KOÇAK, Neşe; Koçak, Onur Ozan; Özbudak, Ferruh; SAYGI, ZÜLFÜKAR (2015-01-01)
In this paper, we consider semi-bentness of quadratic Boolean functions defined for even n and give the characterisation of these functions. Up to our knowledge, semi-bentness of this class has not been investigated before and we proved that semi-bent functions of this form exist only for 6|n. Furthermore, we present a method for enumeration of semi-bent and bent functions in certain classes. Using this method we find the exact number of semi-bent functions of this form. Moreover, we complete some previous ...
Integrable KdV systems: Recursion operators of degree four
Gurses, M; Karasu, Atalay (1999-01-25)
The recursion operator and bi-Hamiltonian formulation of the Drinfeld-Sokolov system are given. (C) 1999 Elsevier Science B.V.
Square reflection cryptanalysis of 5-round Feistel networks with permutations
Kara, Orhun (2013-09-01)
In this work, we introduce a new generic attack on 5-round Feistel networks whose round functions are random permutations, under the condition that the second and the fourth round keys are equal. The attack is a combination of the square attack technique with the reflection attack technique and exploits the unbalanced distribution of the fixed points of the inner rounds among all the keys. The data complexity of the attack is inverted right perpendicular4m/ninverted left perpendicular2(n/2) chosen plaintext...
Citation Formats
İ. Sertkaya, “Nonlinearity preserving post-transformations,” M.S. - Master of Science, Middle East Technical University, 2004.