Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

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:
https://doi.org/10.1007/s12095-019-00377-3

Supplemental Material:
Preprint (pdf)

Related NIST Publications:
Journal Article
Conference Paper

Document History:
08/17/19: Journal Article (Final)

Topics

Security and Privacy

cryptography

Technologies

circuits, complexity