Constructing S-boxes with low multiplicative complexity

DOI10.1556/012.2015.52.2.1306MaRDI QIDQ2973168zbMATH OpenOpenAlexFDO

Authors Pavol Zajac

Publication date 31 March 2017

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1556/012.2015.52.2.1306

zbMATH Keywords

\(S\)-boxBoolean functionsmultiplicative complexity

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Recommendations

• An analysis of a class of algorithms for S-box construction
• scientific article; zbMATH DE number 1024007
• Constructions of S-boxes with uniform sharing
• Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
• Differential uniformity and linearity of S-boxes by multiplicative complexity
• The method of S-box construction
• Construction methods for a class of lightweight optimal S-boxes
• scientific article; zbMATH DE number 503275
• A new construction of highly nonlinear S-boxes
• A novel heuristic method for obtaining \(S\)-boxes

Cited in

(6)

• Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
• Cryptographic properties of small bijective S-boxes with respect to modular addition
• Differential uniformity and linearity of S-boxes by multiplicative complexity
• The multiplicative complexity of Boolean functions on four and five variables
• scientific article; zbMATH DE number 1024007 (Why is no real title available?)
• A lower bound for differential uniformity by multiplicative complexity \& bijective functions of multiplicative complexity 1 over finite fields

This page was built for publication: Constructing S-boxes with low multiplicative complexity

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