The multiplicative complexity of Boolean functions on four and five variables
From MaRDI portal
Publication:2946971
DOI10.1007/978-3-319-16363-5_2zbMATH Open1382.94167DBLPconf/lightsec/TuranP14OpenAlexW1215869821WikidataQ62472210 ScholiaQ62472210MaRDI QIDQ2946971FDOQ2946971
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
- Logic minimization techniques with applications to cryptology
- PRESENT: An Ultra-Lightweight Block Cipher
- Four Measures of Nonlinearity
- Title not available (Why is that?)
- A Classification of the Cosets of the Reed-Muller Code R (1, 6)
- Weight distributions of the cosets of the (32,6) Reed-Muller code
- SPONGENT: The Design Space of Lightweight Cryptographic Hashing
- Automata, Languages and Programming
- The multiplicative complexity of quadratic boolean forms
- Pushing the limits: a very compact and a threshold implementation of AES
- \(AGL(m,2)\) acting on \(R(r,m)/R(s,m)\)
Cited In (6)
- Upper bounds on the multiplicative complexity of symmetric Boolean functions
- On various nonlinearity measures for Boolean functions
- The multiplicative complexity of 6-variable Boolean functions
- 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)
