On an algorithm generating 2-to-1 APN functions and its applications to ``The big APN problem''
type: Item
instance of: scholarly article
title: On an algorithm generating 2-to-1 APN functions and its applications to ``The big APN problem''
zbMATH Open document ID: 1420.94074
author: Valeriya Idrisova
published in: Cryptography and Communications
publication date: 2019-01-08T00:00:00Z
Mathematics Subject Classification ID: 94D10
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6998168
zbMATH Keywords: Boolean function
zbMATH Keywords: APN function
zbMATH Keywords: 2-to-1 function
zbMATH Keywords: APN permutation
zbMATH Keywords: differential uniformity
zbMATH Keywords: S-box
MaRDI profile type: Publication
full work available at URL: s12095-018-0310-9
OpenAlex ID: W2802171260
cites work: On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
cites work: On Almost Perfect Nonlinear Permutations
cites work: Differential cryptanalysis of DES-like cryptosystems
cites work: Differential Properties of ${x\mapsto x^{2^{t}-1}}$
cites work: Perfect nonlinear functions and cryptography
cites work: On the classification of APN functions up to dimension five
cites work: Q3062262
cites work: Construction and Analysis of Cryptographic Functions
cites work: A note on APN permutations in even dimension
cites work: Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
cites work: A Generalisation of Dillon's APN Permutation With the Best Known Differential and Nonlinear Properties for All Fields of Size $2^{4k+2}$
cites work: Open Questions on Nonlinearity and on APN Functions
cites work: Codes, bent functions and permutations suitable for DES-like cryptosystems
cites work: One-to-one highly nonlinear power functions on \(\mathrm{GF}(2^n)\)
cites work: Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
cites work: Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
cites work: Q2712106
cites work: О приближении дискретных функций линейными функциями
cites work: О матрицах переходов разностей при использовании некоторых модулярных групп
cites work: Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
cites work: A proof of the Welch and Niho conjectures on cross-correlations of binary \(m\)-sequences
cites work: Affinity of permutations of \(\mathbb F_{2}^{n}\)
cites work: Q4279516
cites work: The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
cites work: Q3216750
cites work: Q4934708
cites work: Q4484892
cites work: Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
cites work: Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
cites work: Almost perfect and planar functions
cites work: Q5146094
cites work: On the symmetric properties of APN functions
DOI: 10.1007/S12095-018-0310-9
description: scientific article; zbMATH DE number 6998168