सैद्धांतिक और कम्प्यूटेशनल विज्ञान जर्नल
खुला एक्सेस

अमूर्त

About Efficient Algorithm for Factoring Semiprime Number

Yonatan Zilpa

The complexity needed to factor large semiprime numbers is in the heart of public key cryptography. It is very important to identify cases where semiprime factorization can be done efficiently. This article introduce mathematical method for semiprime factorization. Hopefully it will help researchers to close further gaps and make public key cryptography safer [1,2].