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.

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

Poster

Poster: Additive and Multiplicative Complexities of Circuits

October 28, 2021

René Peralta

This poster displays results from two research activities of the circuit complexity project in the cryptographic technology group. One benchmarks various optimizations of linear circuits; the other one characterizes the multiplicative complexity of cubic Boolean functions.

NIST-ITL Science Day 2021 (October 28) --- Presentation by video-conference

Poster jointly produced by Luís Brandão and Meltem Sönmez Turan

Additive and Multiplicative Complexities of Circuits (PDF)

Parent Project

See: Circuit Complexity

Information Technology Laboratory

Computer Security Resource Center

Computer Security Resource Center

Poster: Additive and Multiplicative Complexities of Circuits

Presenters

Description

Presented at

Downloads

Parent Project

Related Topics