Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Conference Paper

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: 09/01/2014 - 09/02/2014
Location: Istanbul, Turkey
Citation: Lightweight Cryptography for Security and Privacy, vol. 8898, pp. 21-33

Abstract

Keywords

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

None selected

Documentation

Publication:
https://doi.org/10.1007/978-3-319-16363-5_2

Supplemental Material:
None available

Related NIST Publications:
Journal Article
Journal Article

Document History:
03/17/15: Conference Paper (Final)

Topics

Security and Privacy

lightweight cryptography

Technologies

circuits, complexity