The Multiplicative Complexity of Boolean Functions on Four and Five Variables

DOI10.1007/978-3-319-16363-5_2zbMath1382.94167OpenAlexW1215869821WikidataQ62472210 ScholiaQ62472210MaRDI QIDQ2946971

René Peralta, Meltem Turan Sönmez

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 functionscircuit complexityaffine transformationmultiplicative complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

On various nonlinearity measures for Boolean functions ⋮ Upper bounds on the multiplicative complexity of symmetric Boolean functions ⋮ On compiling Boolean circuits optimized for secure multi-party computation ⋮ Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity ⋮ The multiplicative complexity of 6-variable Boolean functions ⋮ Boolean functions with multiplicative complexity 3 and 4

Cites Work

• Unnamed Item
• Unnamed Item
• The multiplicative complexity of quadratic boolean forms
• \(AGL(m,2)\) acting on \(R(r,m)/R(s,m)\)
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• Logic minimization techniques with applications to cryptology
• Pushing the Limits: A Very Compact and a Threshold Implementation of AES
• PRESENT: An Ultra-Lightweight Block Cipher
• Four Measures of Nonlinearity
• A Classification of the Cosets of the Reed-Muller Code R (1, 6)
• SPONGENT: The Design Space of Lightweight Cryptographic Hashing
• Weight distributions of the cosets of the (32,6) Reed-Muller code
• Automata, Languages and Programming

This page was built for publication: The Multiplicative Complexity of Boolean Functions on Four and Five Variables