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

White Paper

On the Multiplicative Complexity of Cubic Boolean Functions

Date Published: August 2021

Author(s)

Meltem Sönmez Turan (NIST), Rene Peralta (NIST)

Abstract

Keywords

secret-key cryptography; multiplicative complexity; Boolean and cubic functions
Control Families

None selected

Documentation

Publication:
Paper

Supplemental Material:
None available

Document History:
08/11/21: White Paper (Final)

Topics

Security and Privacy
cryptography

Technologies
complexity