Computer Security Resource Center

Computer Security Resource Center

Computer Security
Resource Center

Journal Article

The Multiplicative Complexity of 6-variable Boolean Functions

Published: April 03, 2018
Citation: Cryptography and Communications (2018) pp. 1-15

Author(s)

Çağdaş Çalık (NIST), Meltem Sönmez Turan (NIST), Rene Peralta (NIST)

Abstract

Keywords

affine equivalence; Boolean functions; circuit complexity; cryptography; multiplicative complexity
Control Families

None selected

Documentation

Publication:
Journal Article (DOI)

Supplemental Material:
Preprint (pdf)

Related NIST Publications:
Journal Article
Conference Proceedings

Topics

Security and Privacy
cryptography