Constructing permutations of finite fields via linear translators
نویسنده
چکیده
We study the permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn is a linear translator of f : Fqn → Fq. We determine the cycle structure and the inverse of such a permutation. We describe several families of permutation polynomials obtained using functions with linear translators.
منابع مشابه
Permutations via linear translators
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [9], we give in several cases the compositional inverse of these permutations. The connection with com...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملConstructing Finite Frames via Platonic Solids
Finite tight frames have many applications and some interesting physical interpretations. One of the important subjects in this area is the ways for constructing such frames. In this article we give a concrete method for constructing finite normalized frames using Platonic solids.
متن کاملOn constructing permutations of finite fields
Motivated by several constructions of permutation polynomials done by several authors (most notably by Zieve), we propose a unified treatment for a large set of classes of permutation polynomials of Fq. Our approach yields a recipe for constructing several new and old classes of permutation polynomials of Fq.
متن کاملA Stream Cipher Based on Chaotic Permutations
In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 118 شماره
صفحات -
تاریخ انتشار 2011