Poster: Additive and Multiplicative Complexities of Circuits
October 28, 2021
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