Synthesis and Optimization of Reversible Circuits for Homogeneous Boolean Functions

TL;DR

This paper presents a factorization algorithm for synthesizing optimized reversible circuits for homogeneous Boolean functions, which are crucial in cryptography and quantum computing.

Contribution

It introduces a novel factorization algorithm specifically designed for constructing efficient reversible circuits for homogeneous Boolean functions.

Findings

The algorithm enables the synthesis of optimized reversible circuits.

It facilitates potential cryptographic and quantum computing applications.

The method improves circuit efficiency compared to previous approaches.

Abstract

Homogenous Boolean function is an essential part of any cryptographic system. The ability to construct an optimized reversible circuits for homogeneous Boolean functions might arise the possibility of building cryptographic system on novel computing paradigms such as quantum computers. This paper shows a factorization algorithm to synthesize such circuits.