Computer Security Resource Center

Computer Security Resource Center

Computer Security
Resource Center

White Paper

The Number of Boolean Functions with Multiplicative Complexity 2

Date Published: 10/27/2015

Author(s)

Magnus Find (NIST), Daniel Smith-Tone (NIST), Meltem Sönmez Turan (NIST)

Abstract

Keywords

Affine equivalence; Boolean functions; Cryptography; Multiplicative complexity; Self-mappings
Control Families

None selected

Documentation

Publication:
Paper

Supplemental Material:
None available

Topics

Security and Privacy
encryption