On Two-to-One Mappings Over Finite Fields

DOI10.1109/TIT.2019.2933832zbMath1433.11137arXiv1907.01066OpenAlexW2968307249MaRDI QIDQ5211547

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)

Related Items

On two conjectures about the intersection distribution ⋮ Survey on recent trends towards generalized differential and boomerang uniformities ⋮ On construction and (non)existence of \(c\)-(almost) perfect nonlinear functions ⋮ Generalized Hamming weights of linear codes from cryptographic functions ⋮ Construction of \(\varepsilon_d\)-ASIC-POVMs via 2-to-1 PN functions and the Li bound ⋮ Further projective binary linear codes derived from two-to-one functions and their duals ⋮ On the \(c\)-differential uniformity of certain maps over finite fields ⋮ New P\(c\)N and AP\(c\)N functions over finite fields ⋮ Two-to-one mappings and involutions without fixed points over \(\mathbb{F}_{2^n}\) ⋮ 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