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 :)

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