A Fast Factorization Method

15 Pages Posted: 2 Oct 2017 Last revised: 23 Oct 2017

Date Written: April 5, 2017


Integer factorization is one of the mathematical aspects which are largely applied in our daily activities. One of the situations where factoring is applied is in cryptography which is the treasured portion of e-commerce systems. Due improved encryption currently banking institutions, business firms, government institutions, online merchants and many other groups and individuals are using e-commerce platform to send and receive confidential information such as transferring money. Cryptography enhances the integrity and authenticity of the data and communication between legit by assigning specific private keys to participants. The keys are generated by factorizing a large number, and they can only be decrypted by the assigned individuals only. The number under quest is large enough such that finding their factors which are the keys takes a lot of time and becomes costly than the information encrypted by those keys especially when using the old Trial Division method. Therefore it has been a concern of researchers to come up with a better method of finding the Keys.

Keywords: RSA, Factoring, Prime Numbers, Cryptography, RSA Algorithm, RSA Key Cryptography, Fast Factorization Method, RSA Attacks

JEL Classification: C00, C02

Suggested Citation

Boatto, Alessandro, A Fast Factorization Method (April 5, 2017). Available at SSRN: https://ssrn.com/abstract=3046053 or http://dx.doi.org/10.2139/ssrn.3046053

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
PlumX Metrics