Generalizations of complete mappings of finite fields and some applications
From MaRDI portal
Publication:2437319
DOI10.1016/j.jsc.2013.12.006zbMath1332.11107OpenAlexW2026528069MaRDI QIDQ2437319
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2013.12.006
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Polynomials over finite fields (11T06)
Related Items
New classes of complete permutation polynomials ⋮ Unnamed Item ⋮ Coset-wise affine functions and cycle types of complete mappings ⋮ Complete mappings and Carlitz rank ⋮ Several classes of complete permutation polynomials with Niho exponents ⋮ Cycle types of complete mappings of finite fields ⋮ On the difference between permutation polynomials ⋮ Local permutation polynomials and the action of e-Klenian groups ⋮ Compositions and parities of complete mappings and of orthomorphisms ⋮ On derivatives of planar mappings and their connections to complete mappings ⋮ Finite groups with an automorphism that is a complete mapping ⋮ On generalized strong complete mappings and mutually orthogonal Latin squares
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The existence of strong complete mappings
- Cyclotomic \(\mathcal R\)-orthomorphisms of finite fields
- Sequences, discrepancies and applications
- Incomplete character sums and a special class of permutations
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- Permutations of finite fields for check digit systems
- The Construction of Orthogonal Latin Squares