Computer Security Resource Center

Computer Security Resource Center

Computer Security
Resource Center

Conference Proceedings

The Multiplicative Complexity of Boolean Functions on Four and Five Variables

Published: March 17, 2015

Author(s)

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

Conference

Name: Third International Workshop on Lightweight Cryptography for Security and Privacy (LightSec 2014)
Dates: September 1-2, 2014
Location: Istanbul, Turkey
Citation: Lightweight Cryptography for Security and Privacy, Lecture Notes in Computer Science vol. 8898, pp. 21-33

Abstract

Keywords

affine transformation; Boolean functions; circuit complexity; multiplicative complexity
Control Families

None selected

Documentation

Publication:
Conference Proceedings (DOI)

Supplemental Material:
None available

Related NIST Publications:
Journal Article

Topics

Security and Privacy
cryptography