Constructing S-boxes with low multiplicative complexity
Studia Scientiarum Mathematicarum Hungarica · 2015
DOI: 10.1556/012.2015.52.2.1306 ↗Kurz gefasst
Fachartikel in der Zeitschrift Studia Scientiarum Mathematicarum Hungarica, 2015. Verfasst von Pavol Zajac.
Abstract (Originalsprache)
Multiplicative complexity is the minimum number of AND-gates required to implement a given Boolean function in (AND, XOR) algebra. It is a good measure of a hardware complexity of an S-box, but an S-box cannot have too low multiplicative complexity due to security constraints. In this article we focus on generic constructions that can be used to find good n × n S-boxes with low multiplicative complexity. We tested these constructions in the specific case when n = 8. We were able to find 8 × 8 S-boxes with multiplicative complexity at most 16 (which is half of the known bound on multiplicative complexity of the AES S-box), while providing a reasonable resistance against linear and differential cryptanalysis.
Zitieren
APA
Zajac, P. (2015). Constructing S-boxes with low multiplicative complexity. Studia Scientiarum Mathematicarum Hungarica. https://doi.org/10.1556/012.2015.52.2.1306
Vancouver
Zajac P. Constructing S-boxes with low multiplicative complexity. Studia Scientiarum Mathematicarum Hungarica. 2015. doi:10.1556/012.2015.52.2.1306
BibTeX
@article{Zajac2015,
author = {Zajac, Pavol},
title = {Constructing S-boxes with low multiplicative complexity},
journal = {Studia Scientiarum Mathematicarum Hungarica},
year = {2015},
doi = {10.1556/012.2015.52.2.1306}
}
EUVIMED