U.S. flag   An unofficial archive of your favorite United States government website
Dot gov

Official websites do not use .rip
We are an unofficial archive, replace .rip by .gov in the URL to access the official website. Access our document index here.

Https

We are building a provable archive!
A lock (Dot gov) or https:// don't prove our archive is authentic, only that you securely accessed it. Note that we are working to fix that :)

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