Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
type: Item
instance of: scholarly article
title: Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
zbMATH Open document ID: 1294.94087
author: Pavol Zajac
author: Matúš Jókay
published in: Cryptography and Communications
publication date: 2014-06-20T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6305824
zbMATH Keywords: S-box
zbMATH Keywords: multiplicative complexity
zbMATH Keywords: affine equivalence
describes a project that uses: PRESENT
MaRDI profile type: Publication
Wikidata QID: Q114221281
full work available at URL: s12095-014-0100-y
OpenAlex ID: W1994781818
cites work: Threshold Implementations of All 3 ×3 and 4 ×4 S-Boxes
cites work: Q4434867
cites work: PRESENT: An Ultra-Lightweight Block Cipher
cites work: Tight bounds for the multiplicative complexity of symmetric functions
cites work: Higher-Order Masking Schemes for S-Boxes
cites work: On multiplication in finite fields
cites work: On the Classification of 4 Bit S-Boxes
cites work: Q3216750
cites work: The multiplicative complexity of quadratic boolean forms
cites work: Cryptographic Analysis of All 4 × 4-Bit S-Boxes
cites work: A new method to solve MRHS equation systems and its connection to group factorization
DOI: 10.1007/S12095-014-0100-Y
description: scientific article; zbMATH DE number 6305824