Some characterizations of generalized s-plateaued functions

Download

index.pdf

Date

2017

Author

Çelik, Emircan

Metadata

Show full item record

Item Usage Stats

176
views

55
downloads

Plateaued functions play important role in cryptography because of their various desirable cryptographic features. Due to this characteristics they have been widely studied in the literature. This studies include p-ary functions and some generalizations of the boolean functions. In this thesis, we present some of this important work and show that plateaued functions can be generalized much more general framework naturally. Characterizations of generalized plateaued functions using Walsh power moments are also given.

Subject Keywords

Cryptography., Walsh functions., Boolean functions., Plateaued functions., Data encryption (Computer science).

URI

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

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

Results on characterizations of plateaued functions in arbitrary characteristic Mesnager, Sihem; Özbudak, Ferruh; Sınak, Ahmet (2016-01-01) Bent and plateaued functions play a significant role in cryptography since they can have various desirable cryptographic properties. In this work, we first provide the characterizations of plateaued functions in terms of the moments of their Walsh transforms. Next, we generalize the characterizations of Boolean bent and plateaued functions in terms of their second-order derivatives to arbitrary characteristic. Moreover, we present a new characterization of plateaued functions in terms of fourth power moment...
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.
On the efficient implementation of RSA Güner, Hatice Kübra; Cenk, Murat; Department of Cryptography (2015) Modular exponentiation is an essential operation for many asymmetric key cryptosystems such as RSA in which encryption and decryption are based on modular exponentiation. Therefore, efficiency of the system is effected with running time of the modular exponentiation algorithm. At the same time, key sizes also influence the efficiency of the algorithm. Over the years key sizes had to be increased to provide security. To make RSA practical, one of usable choices is acceleration of the modular exponentiation a...
On nonlinearity and hamming weight preserving bijective mappings acting on boolean functions Sertkaya, İsa; Doğanaksoy, Ali; Department of Cryptography (2014) Boolean functions are widely studied in cryptography due to their key role and ap- plications in various cryptographic schemes. Particularly in order to make symmetric crypto-systems resistant against cryptanalytic attacks, Boolean functions are associ- ated some cryptographic design criteria. As a result of Shannon’s similarity of secrecy systems theory, cryptographic design criteria should be at least preserved under the action of basic transformations. Among these design criteria, Meier and Staffelbach a...
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 ...

Citation Formats

E. Çelik, “Some characterizations of generalized s-plateaued functions,” M.S. - Master of Science, Middle East Technical University, 2017.