A complete permutation over GF(2²ᵐ) with easy hardware implementation and the best known cryptography properties

DOI10.11845/SXJZ.2015041BzbMATH Open1389.11148OpenAlexW2920815888MaRDI QIDQ5367654FDOQ5367654

Authors: Zailiang Tang, Mingsheng Wang 

Publication date: 20 October 2017

Full work available at URL: http://www.oaj.pku.edu.cn/sxjz/CN/abstract/abstract71272.shtml

Recommendations

• More low differential uniformity permutations over \(\mathbb{F}_{2^{2 k}}\) with \(k\) odd
• Further results on differentially 4-uniform permutations over \(\mathbb{F}_{2^{2m}}\)
• On Almost Perfect Nonlinear Permutations
• Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
• New families of differentially 4-uniform permutations over \({\mathbb F}_{2^{2k}}\)

zbMATH Keywords

nonlinearitydifferential uniformityS-boxeslightweight cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Cited In (3)

• Heuristic algorithm for obtaining permutations with given cryptographic properties using a generalized construction
• Decomposition of Dillon's APN permutation with efficient hardware implementation
• On decompositions of permutation polynomials into quadratic and cubic power permutations

This page was built for publication: A complete permutation over \(\mathrm{GF}(2^{2m})\) with easy hardware implementation and the best known cryptography properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367654)