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

The Multiplicative Complexity of 6-variable Boolean Functions

Published: April 3, 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:
https://doi.org/10.1007/s12095-018-0297-2

Supplemental Material:
Preprint (pdf)

Related NIST Publications:
Journal Article
Conference Paper

Document History:
04/03/18: Journal Article (Final)

Topics

Security and Privacy

cryptography

Technologies

circuits, complexity