Multiplication Complexity Optimization based on Quantified Boolean Formulas

In the field of cryptography and security, minimizing the number of AND gates within logic networks is crucial. Such optimization significantly influences the multiplication complexity of circuits. This paper proposes a Quantified Boolean Formulas (QBF) based resynthesis to dynamically construct local circuits from sub-circuits, with the goal of minimizing the number of AND gates and optimizing the number of XOR gate numbers in well-optimized networks. Experimental results on parts of the EPFL benchmarks suite indicate that the proposed method effectively reduces the number of AND gates by 15.51 % and the number of XOR gates by 3.34%.