A Novel Encryption Methodology with Prime Factorization through Reversible Logic Gates

Abstract

this paper is to determine the feasibility of using hardware to perform prime factorization of a semi-prime number. The application of this research can primarily impact the field of cybersecurity. By deconstructing the view of digital logic gates being one-way functions, we propose to reverse the typical flow of information. The reversible logic gates are developed with Python codes, larger reversible digital circuits are constructed until a full array multiplier is ready for testing. An analysis is performed with a semi-prime number of 4 binary digits up to 1024 binary digits long. Although the reversible logic gates are able to deduce new information, it is not enough information to perform the prime factorization of a semi-prime number. Based on these results, we conclude that more information needs to be created for reversible logic gates to be a feasible method of prime factorization. Further research can be performed, such as defining more relationships between bits, and this research can apply the reversible logic gates to other digital circuits.