Contributions on plateaued (vectorial) functions for symmetric cryptography and coding theory

Download

index.pdf

Date

2017

Author

Sınak, Ahmet

Metadata

Show full item record

Item Usage Stats

248
views

120
downloads

Plateaued functions, used to construct nonlinear functions and linear codes, play a significant role in cryptography and coding theory. They can possess various desirable cryptographic properties such as high nonlinearity, low autocorrelation, resiliency, propagation criteria, balanced-ness and correlation immunity. In fact, they provide the best possible compromise between resiliency order and nonlinearity. Besides they resist against linear cryptanalysis and fast correlation attacks due to their low Walsh-Hadamard transform values. Indeed, cryptographic algorithms are usually designed by appropriate composition of nonlinear functions, hence plateaued functions have a great effect on the security of these algorithms. Additionally, plateaued functions are closely related to linear codes, the most significant class of codes in coding theory, which have diverse applications in secret sharing schemes, authentication codes, communication, data storage devices and consumer electronics. The main objectives of this thesis are twofold: to study in detail the explicit characterizations for plateaued-ness of functions over finite fields from a cryptographic point of view, and to construct linear codes from weakly regular plateaued functions in coding theory. In this thesis, we first analyse characterizations of plateaued (vectorial) functions over a finite field F_p with p a prime number. More precisely, we obtain a large number of their characterizations in terms of their Walsh power moments, derivatives and autocorrelation functions, with the aim of both clarifying their structure and obtaining information about their construction. In particular, we observe the non-existence of a homogeneous cubic bent function (and in some cases a (homogeneous) cubic plateaued function) over F_p with p an odd prime. Moreover, we show the non-existence of a function whose absolute Walsh transform takes exactly three distinct values (one being zero), and introduce a new class of functions whose absolute Walsh transform takes exactly four distinct values (one being zero). Furthermore, we study partially bent and plateaued functions over a finite field F_q, with q a prime power, and obtain some of their characterizations in order to understand their behaviour over this field. In addition, we introduce the notion of (non)-weakly regular plateaued functions over F_p, with p an odd prime, and provide the secondary constructions of these functions. We then construct three-weight linear p-ary (resp. binary) codes from weakly regular p-ary plateaued (resp. Boolean plateaued) functions and determine their weight distributions. Finally, we show that the constructed linear codes can be used to construct secret sharing schemes with ``nice'' access structures. To the best of our knowledge, the construction of linear codes from plateaued functions over F_p, with p an odd prime, is studied in this thesis for the first time in the literature

Subject Keywords

Coding theory., Algebra, Boolean., Vectorial functions., Data encryption (Computer science).

URI

http://etd.lib.metu.edu.tr/upload/12621703/index.pdf
https://hdl.handle.net/11511/26965

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

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 ...
On q-ary plateaued functions over F-q and their explicit characterizations Mesnager, Sihem; Özbudak, Ferruh; Sinak, Ahmet; Cohen, Gerard (Elsevier BV, 2019-08-01) Plateaued and bent functions play a significant role in cryptography, sequence theory, coding theory and combinatorics. In 1997, Coulter and Matthews redefined bent functions over any finite field F-q where q is a prime power, and established their properties. The objective of this work is to redefine the notion of plateaued functions over F-q, and to present several explicit characterizations of those functions. We first give, over F-q, the notion of q-ary plateaued functions, which relies on the concept o...
Modular exponentiation methods in cryptography Yünüak, Hasan Bartu; Cenk, Murat; Department of Cryptography (2017) Modular exponentiation has an important role in many cryptographic algorithms. These exponentiation methods differ in the bases used and their representations, the repeating aspect, and for which algorithms they are used for: fixed or variable base. Our research aims to compare the efficiencies and implementation timings for some selected algorithms. Also, we look at the options for using a dedicated cubing algorithm, and compare them with the current algorithms.
Linearization and optimization of robot dynamics via inertial parameter design Soylu, Reşit (1996-08-01) In this article, the concept of linearity number (LN) is introduced to measure the ''linearity'' of the equations of motion of a serial manipulator. This number is computable in closed-form and is an average quantitative index of the degree of linearity of the robot over a specified region in the joint space. The definition is flexible, allowing the user to create custom-made definitions according to his or her specific needs. Using the concept of LN and the developed computer package CADLOR, one can design...
Characterizations of Partially Bent and Plateaued Functions over Finite Fields Mesnager, Sihem; Özbudak, Ferruh; SINAK, AHMET (2018-12-30) Partially bent and plateaued functions over finite fields have significant applications in cryptography, sequence theory, coding theory, design theory and combinatorics. They have been extensively studied due to their various desirable cryptographic properties. In this paper, we study on characterizations of partially bent and plateaued functions over finite fields, with the aim of clarifying their structure. We first redefine the notion of partially bent functions over any finite field Fq , with q a prim...

Citation Formats

A. Sınak, “Contributions on plateaued (vectorial) functions for symmetric cryptography and coding theory,” Ph.D. - Doctoral Program, Middle East Technical University, 2017.