Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes

DOI10.1007/s12095-014-0100-yzbMath1294.94087OpenAlexW1994781818WikidataQ114221281 ScholiaQ114221281MaRDI QIDQ2016430

Pavol Zajac, Matúš Jókay

Publication date: 20 June 2014

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-014-0100-y

zbMATH Keywords

affine equivalencemultiplicative complexityS-box

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Differential uniformity and linearity of S-boxes by multiplicative complexity ⋮ FROM CRYPTANALYSIS TO CRYPTOGRAPHIC PROPERTY OF A BOOLEAN FUNCTION ⋮ Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity ⋮ Cryptographic properties of small bijective S-boxes with respect to modular addition

Uses Software

• PRESENT

Cites Work

• Unnamed Item
• Unnamed Item
• Tight bounds for the multiplicative complexity of symmetric functions
• On multiplication in finite fields
• The multiplicative complexity of quadratic boolean forms
• A new method to solve MRHS equation systems and its connection to group factorization
• Cryptographic Analysis of All 4 × 4-Bit S-Boxes
• PRESENT: An Ultra-Lightweight Block Cipher
• Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes
• Higher-Order Masking Schemes for S-Boxes
• On the Classification of 4 Bit S-Boxes

This page was built for publication: Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes