Reducing the number of AND gates plays a central role in many cryptography and security
applications. We propose a logic synthesis algorithm and tool to minimize the number of …

This paper proposes a novel methodology for multi-level logic synthesis that is independent
from a specific graph data-structure, but formulates synthesis procedures using an abstract …

The complexity of modern hardware designs necessitates advanced methodologies for
optimizing and analyzing modern digital systems. In recent times, machine learning (ML) …

Logic synthesis is a fundamental step in the realization of modern integrated circuits. It has
traditionally been employed for the optimization of CMOS-based designs, as well as for …

We present a constructive method to create quantum circuits that implement oracles| x>| y>|
0> k→| x>| y⊕ f (x)>| 0> k for n-variable Boolean functions f with low T-count. In our method f …

In this paper, we present a new method to find S-box circuits with optimal multiplicative
complexity (MC), ie, MC-optimal S-box circuits. We provide new observations for efficiently …

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 …

Modern logic synthesis techniques use multilevel technology-independent representations
like and-inverter-graphs (AIGs) for digital logic. This involves structural rewriting …

Fully homomorphic encryption (FHE) enables secure data processing without compromising
data access, but its computational cost and slower execution compared to plaintext …

XOR-AND Graphs (XAGs) are an enrichment of the classical AND-Inverter Graphs (AIGs)
with XOR nodes. In particular, XAGs are networks composed by ANDs, XORs, and inverters …