Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)

DOI10.1016/j.ffa.2021.101913zbMath1484.11218arXiv2105.11323OpenAlexW3195080265MaRDI QIDQ2238924

Dabin Zheng, Mu Yuan, Yan-Ping Wang

Publication date: 2 November 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.11323

zbMATH Keywords

symbolic computationfinite fieldinvolutiontwo-to-one mapping

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06)

Related Items (3)

Further projective binary linear codes derived from two-to-one functions and their duals ⋮ More constructions of \(n\)-cycle permutations ⋮ Characterizations and constructions of \(n\)-to-1 mappings over finite fields

Uses Software

• PRINCE

Cites Work

• Unnamed Item
• Unnamed Item
• New classes of permutation binomials and permutation trinomials over finite fields
• Further results on planar DO functions and commutative semifields
• Two classes of permutation polynomials having the form \((x^{2^m}+x+\delta)^s+x\)
• Reflection ciphers
• Some new classes of permutation trinomials over finite fields with even characteristic
• On constructing permutations of finite fields
• When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
• On Dillon's class \(H\) of bent functions, Niho bent functions and o-polynomials
• Permutation polynomials over finite fields from a powerful lemma
• Almost perfect and planar functions
• Two new permutation polynomials with the form \({\left(x^{2^k}+x+\delta\right)^{s}+x}\) over \({\mathbb{F}_{2^n}}\)
• New constructions of permutation polynomials of the form \(x^rh\left( x^{q-1}\right) \) over \({\mathbb F}_{q^2}\)
• Two types of permutation polynomials with special forms
• On APN functions \(L_1(x^3) + L_2(x^9)\) with linear \(L_1\) and \(L_2\)
• Involutory differentially 4-uniform permutations from known constructions
• New Kloosterman sums identities over \(\mathbb F_{2^m}\) for all \(m\).
• New constructions of involutions over finite fields
• Further results on permutation polynomials over finite fields
• Paley type group schemes and planar Dembowski-Ostrom polynomials
• Further results on permutation trinomials over finite fields with even characteristic
• Explicit formulas for monomial involutions over finite fields
• Several classes of permutation trinomials from Niho exponents
• Constructing permutations of finite fields via linear translators
• Several classes of complete permutation polynomials
• Four classes of permutation polynomials of \(\mathbb F_{2^m}\)
• Reflection cryptanalysis of PRINCE-like ciphers
• Dickson polynomials that are involutions
• Permutation polynomials of ${\rm{F}}_{q^2 } $ of the form aX + X^r(q−1)+1
• Permutation polynomials of the form X + γ Tr(X^k)
• Involutions Over the Galois Field
• Permutation Trinomials Over Finite Fields with Even Characteristic
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• Further Study of 2-to-1 Mappings Over F_2ⁿ
• Binary Linear Codes With Few Weights From Two-to-One Functions
• Constructions of Involutions Over Finite Fields
• On Two-to-One Mappings Over Finite Fields
• Cyclotomic Mapping Permutation Polynomials over Finite Fields
• On the solution of algebraic equations over finite fields
• Fast Software Encryption

This page was built for publication: Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)