The multiplicative complexity of Boolean functions on four and five variables

DOI10.1007/978-3-319-16363-5_2MaRDI QIDQ2946971zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Meltem Turan Sönmez, René Peralta

Publication date 18 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-16363-5_2

zbMATH Keywords

Boolean functionsmultiplicative complexitycircuit complexityaffine transformation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The number of Boolean functions with multiplicative complexity 2
• The multiplicative complexity of 6-variable Boolean functions
• Boolean functions with multiplicative complexity 3 and 4
• Constructing S-boxes with low multiplicative complexity
• Multiplicative complexity of some Boolean functions

Cites work

• scientific article; zbMATH DE number 5862915 (Why is no real title available?)
• scientific article; zbMATH DE number 4108153 (Why is no real title available?)
• A Classification of the Cosets of the Reed-Muller Code R (1, 6)
• Automata, Languages and Programming
• Four measures of nonlinearity
• Logic minimization techniques with applications to cryptology
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• PRESENT: An Ultra-Lightweight Block Cipher
• Pushing the limits: a very compact and a threshold implementation of AES
• SPONGENT: The Design Space of Lightweight Cryptographic Hashing
• The multiplicative complexity of quadratic boolean forms
• Weight distributions of the cosets of the (32,6) Reed-Muller code
• \(AGL(m,2)\) acting on \(R(r,m)/R(s,m)\)

Cited in

(9)

• Upper bounds on the multiplicative complexity of symmetric Boolean functions
• On hardware implementation of Tang-maitra Boolean functions
• On various nonlinearity measures for Boolean functions
• Multiplicative complexity of bijective \(4\times 4\) \(S\)-boxes
• The multiplicative complexity of 6-variable Boolean functions
• Small low-depth circuits for cryptographic applications
• On compiling Boolean circuits optimized for secure multi-party computation
• Boolean functions with multiplicative complexity 3 and 4
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity

This page was built for publication: The multiplicative complexity of Boolean functions on four and five variables

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