Application of composition primitive polynomials for implementation of large-scale S-boxes

DOI10.1134/S1995080213040136MaRDI QIDQ2442491zbMATH OpenFDO

Authors Hoang Duc Tho

Publication date 3 April 2014

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1995080213040136

zbMATH Keywords

cryptographyfinite fieldsS-box

Mathematics Subject Classification ID

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

Recommendations

• Algorithm of construction of optimal according to criterion of zero correlation non-binary S-boxes
• Construction of \(\mathrm{S}_8\) Liu J S-boxes and their applications
• scientific article; zbMATH DE number 1024007
• The method of S-box construction
• Comparison of random S-box generation methods

Cites work

• scientific article; zbMATH DE number 2009947 (Why is no real title available?)
• Boolean functions in coding theory and cryptography. Translated from the Russian by Svetla Nikova

This page was built for publication: Application of composition primitive polynomials for implementation of large-scale S-boxes

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