Affine equivalence and non-linearity of permutations over Z_n
From MaRDI portal
Publication:2363386
DOI10.1007/S00200-016-0307-6zbMATH Open1366.05003OpenAlexW2553287553MaRDI QIDQ2363386FDOQ2363386
Authors: Yogesh Kumar, P. R. Mishra, N. Rajesh Pillai, R. K. Sharma
Publication date: 19 July 2017
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-016-0307-6
Recommendations
- Differential \(\delta \)-uniformity and non-linearity of permutations over \(\mathbb{Z}_n\)
- On differential uniformity and nonlinearity of permutations on \(\mathbb{Z}_n\)
- Nonlinearity of \(k\)-cycle permutations on \(\mathbb Z_n\)
- Linear permutations and their compositional inverses over 𝔽qn
- A Note on Permutation Polynomials Over $\BBZ _{n}$
- scientific article; zbMATH DE number 2092290
- Excedances of affine permutations
- On CCZ-inequivalence of some families of almost perfect nonlinear functions to permutations
- scientific article; zbMATH DE number 1150248
- On Almost Perfect Nonlinear Permutations
Cites Work
- Highly nonlinear mappings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized bent functions and their properties
- Cryptographic Boolean functions and applications.
- Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova
- New classes of almost bent and almost perfect nonlinear polynomials
- Patterns in permutations and words.
- Title not available (Why is that?)
- Construction and Analysis of Cryptographic Functions
- On Almost Perfect Nonlinear Permutations
- Fast Software Encryption
- CCZ and EA equivalence between mappings over finite Abelian groups
- Analysis of RC4 and Proposal of Additional Layers for Better Security Margin
- Title not available (Why is that?)
Cited In (11)
- Almost perfect nonlinear families which are not equivalent to permutations
- On CCZ-inequivalence of some families of almost perfect nonlinear functions to permutations
- On full differential uniformity of permutations on the ring of integers modulo \(n\)
- An improved affine equivalence algorithm for random permutations
- The affinity of a permutation of a finite vector space
- Cryptographic properties of small bijective S-boxes with respect to modular addition
- Bounds on the maximum nonlinearity of permutations on the rings \(\mathbb{Z}_p\) and \(\mathbb{Z}_{2p}\)
- Construction of highly nonlinear permutations on \(\mathbb{Z}_{2p}\) with differential uniformity at most 8
- Nonlinearity of \(k\)-cycle permutations on \(\mathbb Z_n\)
- On differential uniformity and nonlinearity of permutations on \(\mathbb{Z}_n\)
- Differential \(\delta \)-uniformity and non-linearity of permutations over \(\mathbb{Z}_n\)
This page was built for publication: Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363386)