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
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
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
Construction of substitution boxes depending on linear block codes
Download
index.pdf
Date
2004
Author
Yıldız, Senay
Metadata
Show full item record
Item Usage Stats
157
views
73
downloads
Cite This
The construction of a substitution box (S-box) with high nonlinearity and high resiliency is an important research area in cryptography. In this thesis, t-resilient nxm S-box construction methods depending on linear block codes presented in "A Construction of Resilient Functions with High Nonlinearity" by T. Johansson and E. Pasalic in 2000, and two years later in "Linear Codes in Generalized Construction of Resilient Functions with Very High Nonlinearity" by E. Pasalic and S. Maitra are compared and the former one is observed to be more promising in terms of nonlinearity. The first construction method uses a set of nonintersecting [n-d,m,t+1] linear block codes in deriving t-resilient S-boxes of nonlinearity 2̂(n-1)-2̂(n-d-1),where d is a parameter to be maximized for high nonlinearity. For some cases, we have found better results than the results of Johansson and Pasalic, using their construction. As a distinguished reference for nxn S-box construction methods, we study the paper "Differentially Uniform Mappings for Cryptography" presented by K.Nyberg in Eurocrypt 1993. One of the two constructions of this paper, i.e., the inversion mapping described by Nyberg but first noticed in 1957 by L. Carlitz and S. Uchiyama, is used in the S-box of Rijndael, which is chosen as the Advanced Encryption Standard. We complete the details of some theorem and proposition proofs given by Nyberg.
Subject Keywords
Mathematics.
URI
http://etd.lib.metu.edu.tr/upload/12605540/index.pdf
https://hdl.handle.net/11511/14597
Collections
Graduate School of Applied Mathematics, Thesis
Suggestions
OpenMETU
Core
Application of the boundary element method to parabolic type equations
Bozkaya, Nuray; Tezer-Sezgin, Münevver; Department of Mathematics (2010)
In this thesis, the two-dimensional initial and boundary value problems governed by unsteady partial differential equations are solved by making use of boundary element techniques. The boundary element method (BEM) with time-dependent fundamental solution is presented as an efficient procedure for the solution of diffusion, wave and convection-diffusion equations. It interpenetrates the equations in such a way that the boundary solution is advanced to all time levels, simultaneously. The solution at a requi...
Image segmentation and smoothing via partial differential equations
Özmen, Neslihan; Leblebicioğlu, Mehmet Kemal; Department of Scientific Computing (2009)
In image processing, partial differential equation (PDE) based approaches have been extensively used in segmentation and smoothing applications. The Perona-Malik nonlinear diffusion model is the first PDE based method used in the image smoothing tasks. Afterwards the classical Mumford-Shah model was developed to solve both image segmentation and smoothing problems and it is based on the minimization of an energy functional. It has numerous application areas such as edge detection, motion analysis, medical i...
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...
Intelligent analysis of chaos roughness in regularity of walk for a two legged robot
Kaygisiz, BH; Erkmen, İsmet; Erkmen, Aydan Müşerref (Elsevier BV, 2006-07-01)
We describe in this paper a new approach to the identification of the chaotic boundaries of regular (periodic and quasiperiodic) regions in nonlinear systems, using cell mapping equipped with measures of fractal dimension and rough sets. The proposed fractal-rough set approach considers a state space divided into cells where cell trajectories are determined using cell to cell mapping technique. All image cells in the state space, equipped with their individual fractal dimension are then classified as being ...
LOCAL OPERATOR ALGEBRAS FRACTIONAL POSITIVITY AND THE QUANTUM MOMENT PROBLEM
Dosi, Anar (American Mathematical Society (AMS), 2011-02-01)
In the present paper we introduce quantum measures as a concept of quantum functional analysis and develop the fractional space technique in the quantum (or local operator) space framework. We prove that each local operator algebra (or quantum *-algebra) has a fractional space realization. This approach allows us to formulate and prove a noncommutative Albrecht-Vasilescu extension theorem, which in turn solves the quantum moment problem.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Yıldız, “Construction of substitution boxes depending on linear block codes,” M.S. - Master of Science, Middle East Technical University, 2004.