On Two-to-One Mappings Over Finite Fields

DOI10.1109/TIT.2019.2933832MaRDI QIDQ5211547zbMATH OpenOpenAlexFDO

Authors Sihem Mesnager, Longjiang Qu

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Abstract: Two-to-one ($2$-to-$1$) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent functions. In this paper we provide a systematic study of two-to-one mappings that are defined over finite fields. We characterize such mappings by means of the Walsh transforms. We also present several constructions, including an AGW-like criterion, constructions with the form of $x^{r}h(x^{(q-1)/d})$, those from permutation polynomials, from linear translators and from APN functions. Then we present $2$-to-$1$ polynomial mappings in classical classes of polynomials: linearized polynomials and monomials, low degree polynomials, Dickson polynomials and Muller-Cohen-Matthews polynomials, etc. Lastly, we show applications of $2$-to-$1$ mappings over finite fields for constructions of bent Boolean and vectorial bent functions, semi-bent functions, planar functions and permutation polynomials. In all those respects, we shall review what is known and provide several new results.

Cited in

(29)

• Some classes of power functions with low c-differential uniformity over finite fields
• Two-to-one functions from Galois extensions
• Characterizations and constructions of \(n\)-to-1 mappings over finite fields
• On two conjectures about the intersection distribution
• Survey on recent trends towards generalized differential and boomerang uniformities
• On the \(c\)-differential uniformity of certain maps over finite fields
• New PcN and APcN functions over finite fields
• Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\)
• Generalizations of complete mappings of finite fields and some applications
• On construction and (non)existence of \(c\)-(almost) perfect nonlinear functions
• Further projective binary linear codes derived from two-to-one functions and their duals
• A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module
• Generalized Hamming weights of linear codes from cryptographic functions
• Construction of _d-ASIC-POVMs via 2-to-1 PN functions and the Li bound
• On a class of \(m\)-to-1 functions
• Parameterization of Boolean functions by vectorial functions and associated constructions
• New results on \(n\)-to-1 mappings over finite fields
• New results on PcN and APcN polynomials over finite fields
• Two classes of exceptional \(m\)-to-1 rational functions
• New constructions of 2-to-1 mappings over \(\mathbb{F}_{2^n}\) and their applications to binary linear codes
• Complete classification of 3-to-1 quadrinomials of the form \(x^3(x^{3q-3} + bx^{2q-2} + cx^{q-1} + d)\in\mathbb{F}_q[x]\) on \(\mathbb{F}_{q^2}^\ast\)
• Parametric construction approach of balanced Boolean functions from two-to-one mappings
• Further results on the (-1)-differential uniformity of some functions over finite fields with odd characteristic
• Some classes of functions with low c-differential uniformity over finite fields
• Exceptional 2-to-1 rational functions
• The classifications of o-monomials and of 2-to-1 binomials are equivalent
• Investigation of the permutation and linear codes from the Welch APN function
• A class of cubic polynomial semi-bent functions over \(\mathbb{F}_{2^n}\)
• On generalizations of differential uniform permutations over finite fields based on 2-to-1 mappings

This page was built for publication: On Two-to-One Mappings Over Finite Fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211547)