The multiplicative complexity of 6-variable Boolean functions

DOI10.1007/S12095-018-0297-2MaRDI QIDQ1755188zbMATH OpenOpenAlexWikidataFDO

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

Publication date 8 January 2019

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

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

zbMATH Keywords

cryptographyaffine equivalenceBoolean functionsmultiplicative complexitycircuit complexity

Mathematics Subject Classification ID

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

Recommendations

• Multiplicative complexity of some Boolean functions
• On the multiplicative complexity of some Boolean functions
• Boolean functions with multiplicative complexity 3 and 4
• The number of Boolean functions with multiplicative complexity 2
• On the multiplicative complexity of Boolean functions

Cites work

• scientific article; zbMATH DE number 5862915 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A Classification of the Cosets of the Reed-Muller Code R (1, 6)
• Automata, Languages and Programming
• Higher-order masking schemes for S-boxes
• Improved Garbled Circuit: Free XOR Gates and Applications
• On the Complexity of Computing Two Nonlinearity Measures
• On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
• On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\).
• Short non-interactive cryptographic proofs
• Subspaces, subsets, and partitions
• The multiplicative complexity of Boolean functions on four and five variables
• Tight bounds for the multiplicative complexity of symmetric functions
• 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

(7)

• Upper bounds on the multiplicative complexity of symmetric Boolean functions
• Can a differential attack work for an arbitrarily large number of rounds?
• On the multiplicative complexity of quasi-quadratic Boolean functions
• The multiplicative complexity of Boolean functions on four and five variables
• On Formally Self-dual Boolean Functions in 2,4 and 6 Variables
• Automata, Languages and Programming
• Boolean functions with multiplicative complexity 3 and 4

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: The multiplicative complexity of 6-variable Boolean functions

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