Computer Security Resource Center

Computer Security Resource Center

Computer Security
Resource Center

Journal Article

Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions

Published: August 17, 2019
Citation: Cryptography and Communications no. Special Issue on Boolean Functions and Their Applications, (August 2019) pp. 1-24

Author(s)

Luís T. A. N. Brandão (NIST), Çağdaş Çalık (NIST), Meltem Sönmez Turan (NIST), Rene Peralta (NIST)

Abstract

Keywords

Symmetric Boolean functions; multiplicative complexity; logic minimization; upper bounds
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