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
On plateaued functions, linear structures and permutation polynomials
Date
2019-01-01
Author
Mesnager, Sihem
Kaytancı, Kübra
Özbudak, Ferruh
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
160
views
0
downloads
Cite This
We obtain concrete upper bounds on the algebraic immunity of a class of highly nonlinear plateaued functions without linear structures than the one was given recently in 2017, Cusick. Moreover, we extend Cusick’s class to a much bigger explicit class and we show that our class has better algebraic immunity by an explicit example. We also give a new notion of linear translator, which includes the Frobenius linear translator given in 2018, Cepak, Pasalic and Muratović-Ribić as a special case. We find some applications of our new notion of linear translator to the construction of permutation polynomials. Furthermore, we give explicit classes of permutation polynomials over Fqn using some properties of Fq and some conditions of 2011, Akbary, Ghioca and Wang.
Subject Keywords
Plateaued functions
,
Permutation polynomials
,
Linear structure
URI
https://hdl.handle.net/11511/41074
DOI
https://doi.org/10.1007/978-3-030-16458-4_13
Collections
Graduate School of Applied Mathematics, Conference / Seminar
Suggestions
OpenMETU
Core
Permutation polynomials and construction of bent functions
Ongan, Pınar; Doğanaksoy, Ali; Temür, Burcu Gülmez; Department of Cryptography (2021-3-03)
This thesis consists of two main parts: In the first part, a study of several classes ofpermutation and complete permutation polynomials is given, while in the second part,a method of construction of several new classes of bent functions is described.The first part consists of the study of several classes of binomials and trinomialsover finite fields. A complete list of permutation polynomials of the formf(x) =xqn−1q−1+1+bx∈Fqn[x]is obtained for the casen= 5, and a criterion on permutationpol...
Finite bisimulations for switched linear systems
Aydın Göl, Ebru; Lazar, Mircea; Belta, Calin (2013-02-04)
In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interio...
Finite Bisimulations for Switched Linear Systems
Aydın Göl, Ebru; Lazar, Mircea; Belta, Calin (2014-12-01)
In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interio...
New bent functions from permutations and linear translators
MESNAGER, sihem; ONGAN, pınar; Özbudak, Ferruh (2017-04-12)
Starting from the secondary construction originally introduced by Carlet ["On Bent and Highly Nonlinear Balanced/Resilient Functions and Their Algebraic Immunities", Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 2006], that we shall call "Carlet` ssecondary construction", Mesnager has showed how one can construct several new primary constructions of bent functions. In particular, she has showed that three tuples of permutations over the finite field F2m such that the inverse of their sum...
Almost periodic solutions of the linear differential equation with piecewise constant argument
Akhmet, Marat (2009-10-01)
The paper is concerned with the existence and stability of almost periodic solutions of linear systems with piecewise constant argument where t∈R, x ∈ Rn [·] is the greatest integer function. The Wexler inequality [1]-[4] for the Cauchy's matrix is used. The results can be easily extended for the quasilinear case. A new technique of investigation of equations with piecewise argument, based on an integral representation formula, is proposed. Copyright © 2009 Watam Press.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Mesnager, K. Kaytancı, and F. Özbudak, “On plateaued functions, linear structures and permutation polynomials,” 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/41074.