On Two-to-One Mappings Over Finite Fields

From MaRDI portal
Publication:5211547

DOI10.1109/TIT.2019.2933832zbMATH Open1433.11137arXiv1907.01066OpenAlexW2968307249MaRDI QIDQ5211547FDOQ5211547


Authors: Sihem Mesnager, Longjiang Qu Edit this on Wikidata


Publication date: 28 January 2020

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

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 xrh(x(q1)/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.


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







Cited In (19)





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)