Multiplicative complexity (MC) is defined as the minimum number of AND gates required to
implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with …

arXiv:2201.10200v1 [quant-ph] 25 Jan 2022 Page 1 arXiv:2201.10200v1 [quant-ph] 25 Jan 2022
The multiplicative complexity of interval checking Thomas Häner and Mathias Soeken Microsoft …

Garbled circuit (GC) is one of the few promising protocols to realize general-purpose secure
computation. The target computation is represented by a Boolean circuit that is subsequently …

Since 2016, NIST has been standardrizing Post-Quantum Cryptosystems, PQCs. Code-
Based Cryptosystem, CBC, which is considered to be one of PQCs, uses the Syndrome …

Multiplicative complexity is a relevant complexity measure for many advanced cryptographic
protocols such as multi-party computation, fully homomorphic encryption, and zero …

Symmetric cryptography primitives are constructed by iterative applications of linear and
nonlinear layers. Constructing efficient circuits for these layers, even for the linear one, is …

Multiplicative Complexity (MC) is defined as the minimum number of AND gates required to
implement a function with a circuit over the basis AND, XOR, NOT. This complexity measure …

• Lightweight Cryptography Project aims to provide symmetric key cryptography solutions
specific to constrained devices.• Post Quantum Cryptography Project aims to standardize …

Optimizing Cryptographic Circuits Page 1 Optimizing Cryptographic Circuits Luís TAN Brandão
· Çağdaş Çalık · Morris Dworkin · René Peralta · Meltem Sönmez Turan Cryptographic …