Towards Reverse Engineering Reversible Logic
This addresses security concerns in quantum computing architectures by improving resistance to reverse engineering, though it is incremental as it builds on existing synthesis methods.
The paper tackles the problem of reverse engineering reversible logic circuits, proposing a security metric based on the number of embeddings of non-reversible functions and showing that functional synthesis yields circuits more resilient to reverse engineering than structural synthesis.
Reversible logic has two main properties. First, the number of inputs is equal to the number of outputs. Second, it implements a one-to-one mapping; i.e., one can reconstruct the inputs from the outputs. These properties enable its applications in building quantum computing architectures. In this paper, we study reverse engineering of reversible logic circuits, including reverse engineering of non-reversible functions embedded into reversible circuits. We propose the number of embeddings of non-reversible functions into a reversible circuit as the security metric for reverse engineering. We analyze the security benefits of automatic synthesis of reversible circuits. We use our proposed security metric to show that the functional synthesis approaches yield reversible circuits that are more resilient to reverse engineering than the structural synthesis approaches. Finally, we propose scrambling of the inputs and outputs of a reversible circuit to thwart reverse engineering.