Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Constructions of bent functions
Download
index.pdf
Date
2006
Author
Sulak, Fatih
Metadata
Show full item record
Item Usage Stats
183
views
42
downloads
Cite This
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.
Subject Keywords
Mathematics.
URI
http://etd.lib.metu.edu.tr/upload/12607035/index.pdf
https://hdl.handle.net/11511/15503
Collections
Graduate School of Applied Mathematics, Thesis
Suggestions
OpenMETU
Core
On the expected value of the linear complexity of periodic sequences
Özakın, Çiğdem; Özbudak, Ferruh; Department of Cryptography (2004)
In cryptography, periodic sequences with terms in F2 are used almost everywhere. These sequences should have large linear complexity to be cryptographically strong. In fact, the linear complexity of a sequence should be close to its period. In this thesis, we study the expected value for N-periodic sequences with terms in the finite field Fq. This study is entirely devoted to W. Meidl and Harald Niederreiter̕s paper which is أOn the Expected Value of the Linear Complexity and the k-Error Linear Complexity o...
On quasi-compactness of operator nets on Banach spaces
Emelyanov, Eduard (Institute of Mathematics, Polish Academy of Sciences, 2011-01-01)
The paper introduces a notion of quasi-compact operator net on a Banach space. It is proved that quasi-compactness of a uniform Lotz-Rabiger net (T(lambda))(lambda) is equivalent to quasi-compactness of some operator T(lambda). We prove that strong convergence of a quasi-compact uniform Lotz-Rabiger net implies uniform convergence to a finite-rank projection. Precompactness of operator nets is also investigated.
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.
Joint linear complexity of multisequences consisting of linear recurring sequences
Fu, Fang-Wei; Niederreiter, Harald; Özbudak, Ferruh (Springer Science and Business Media LLC, 2009-04-01)
The linear complexity of sequences is one of the important security measures for stream cipher systems. Recently, in the study of vectorized stream cipher systems, the joint linear complexity of multisequences has been investigated. In this paper, we study the joint linear complexity of multisequences consisting of linear recurring sequences. The expectation and variance of the joint linear complexity of random multisequences consisting of linear recurring sequences are determined. These results extend the ...
Strictly singular operators and isomorphisms of Cartesian products of power series spaces
Djakov, PB; Onal, S; Terzioglu, T; Yurdakul, Murat Hayrettin (1998-01-02)
V. P. Zahariuta, in 1973, used the theory of Fredholm operators to develop a method to classify Cartesian products of locally convex spaces. In this work we modify his method to study the isomorphic classification of Cartesian products of the kind E-0(p)(a) x E-infinity(q) (b) where 1 less than or equal to p, q < infinity, p not equal q, a = (a(n))(n=1)(infinity) and b = (b(n))(n=1)(infinity) are sequences of positive numbers and E-0(p)(a), E(infinity)q(b) are respectively l(p)-finite and l(q)-infinite type...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
F. Sulak, “Constructions of bent functions,” M.S. - Master of Science, Middle East Technical University, 2006.