Determination of Efficient Algorithm for Factoring Semiprime Number

Abstract

The difficulty of factoring big semiprime numbers is fundamental to public key cryptography. It is critical to discover circumstances in which semiprime factoriza-tion can be performed efficiently. Our objective is to find use cases where semi prime factorization algorithm can be run efficiently. The mathematical approach for semiprime factorization is introduced in this article. Hopefully, it will aid research-ers in closing further gaps and making public key cryptography safer.