Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)

DOI10.1007/S00200-016-0307-6zbMath1366.05003OpenAlexW2553287553MaRDI QIDQ2363386

R. K. Sharma, Yogesh Kumar, N. Rajesh Pillai, P. R. Mishra

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

zbMATH Keywords

nonlinearitypermutationBoolean functionaffine equivalence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60)

Related Items (6)

Construction of highly nonlinear permutations on \(\mathbb{Z}_{2p}\) with differential uniformity at most 8 ⋮ On full differential uniformity of permutations on the ring of integers modulo \(n\) ⋮ Nonlinearity of k-cycle permutations on ℤn ⋮ Cryptographic properties of small bijective S-boxes with respect to modular addition ⋮ On differential uniformity and nonlinearity of permutations on \(\mathbb{Z}_n\) ⋮ Differential \(\delta \)-uniformity and non-linearity of permutations over \(\mathbb{Z}_n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Patterns in permutations and words.
• Generalized bent functions and their properties
• Codes, bent functions and permutations suitable for DES-like cryptosystems
• Highly nonlinear mappings
• CCZ and EA equivalence between mappings over finite Abelian groups
• New classes of almost bent and almost perfect nonlinear polynomials
• On Almost Perfect Nonlinear Permutations
• Construction and Analysis of Cryptographic Functions
• Analysis of RC4 and Proposal of Additional Layers for Better Security Margin
• Fast Software Encryption

This page was built for publication: Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)