A note on complete polynomials over finite fields and their applications in cryptography
From MaRDI portal
Publication:2434410
DOI10.1016/j.ffa.2013.10.008zbMath1302.11096OpenAlexW1998816295MaRDI QIDQ2434410
Amela Muratović-Ribić, Enes Pašalić
Publication date: 5 February 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2013.10.008
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Polynomials over finite fields (11T06)
Related Items (30)
New classes of complete permutation polynomials ⋮ Groups of permutations generated by function-linear translator pairs ⋮ Unnamed Item ⋮ Coset-wise affine functions and cycle types of complete mappings ⋮ Complete mappings and Carlitz rank ⋮ Cycle types of complete mappings of finite fields ⋮ On the difference between permutation polynomials ⋮ Some classes of complete permutation polynomials over \(\mathbb F_q\) ⋮ Further results on complete permutation monomials over finite fields ⋮ Complete permutation polynomials with the form \((x^{p^m} - x + \delta)^s + a x^{p^m} + b x\) over \(\mathbb{F}_{p^n}\) ⋮ A general construction of regular complete permutation polynomials ⋮ Maximal complete permutations over \(\mathbb{F}_2^n \) ⋮ Constructing permutation polynomials over \(\mathbb{F}_{q^3}\) from bijections \(\mathrm{PG}(2,q)\) ⋮ Several classes of permutation polynomials over the finite field \(\mathbb{F}_{p^{2 m}}\) ⋮ Compositions and parities of complete mappings and of orthomorphisms ⋮ Some results on complete permutation polynomials and mutually orthogonal Latin squares ⋮ Several classes of permutation polynomials based on the AGW criterion over the finite field \(\mathbb{F}_{2^{2m}}\) ⋮ Compositional inverses and complete mappings over finite fields ⋮ Several classes of complete permutation polynomials over finite fields of even characteristic ⋮ On monomial complete permutation polynomials ⋮ Permutation and complete permutation polynomials ⋮ Permutation polynomials and factorization ⋮ On derivatives of planar mappings and their connections to complete mappings ⋮ Extended framework for constructing (complete) permutations by specifying their coordinate functions ⋮ Constructions of complete permutation polynomials ⋮ On Boolean functions with several flat spectra ⋮ A trigonometric approach for Dickson polynomials over fields of characteristic two ⋮ On generalized strong complete mappings and mutually orthogonal Latin squares ⋮ Gowers U<sub>3</sub> Norm of Cubic MMF Bent-Negabent Functions Constructed by using Feistel Functions ⋮ Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- Permutation polynomials and applications to coding theory
- On inverse permutation polynomials
- A note on the coefficients of inverse polynomials
- Planes of order \(n\) with collineation groups of order \(n^ 2\)
- Characterization of Negabent Functions and Construction of Bent-Negabent Functions With Maximum Algebraic Degree
- Monomial bent functions
- Dickson Polynomials Over Finite Fields and Complete Mappings
- Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
- Complete Mapping Polynomials over Finite Field F 16
- The Construction of Orthogonal Latin Squares
This page was built for publication: A note on complete polynomials over finite fields and their applications in cryptography
