Boolean functions with multiplicative complexity 3 and 4

DOI10.1007/s12095-020-00445-zzbMath1468.94964OpenAlexW3043262542MaRDI QIDQ2040305

Çağdaş Çalık, Meltem Sönmez Turan, René Peralta

Publication date: 13 July 2021

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7918276

zbMATH Keywords

Boolean functionsaffine equivalencemultiplicative complexity

Mathematics Subject Classification ID

Boolean functions (06E30) Boolean functions (94D10)

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• The number of Boolean functions with multiplicative complexity 2
• The multiplicative complexity of quadratic boolean forms
• \(AGL(m,2)\) acting on \(R(r,m)/R(s,m)\)
• Short non-interactive cryptographic proofs
• Rasta: a cipher with low ANDdepth and few ANDs per bit
• The multiplicative complexity of 6-variable Boolean functions
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• Upper bounds on the multiplicative complexity of symmetric Boolean functions
• (Leveled) fully homomorphic encryption without bootstrapping
• The Multiplicative Complexity of Boolean Functions on Four and Five Variables
• Ciphers for MPC and FHE
• Improved Garbled Circuit: Free XOR Gates and Applications
• On the Complexity of Computing Two Nonlinearity Measures
• 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
• Automata, Languages and Programming

This page was built for publication: Boolean functions with multiplicative complexity 3 and 4