The RSA Factoring Challenge was a challenge set up by RSA Security in 1991 to encourage the development of faster factoring algorithms, which are important for breaking the RSA cryptosystem. The challenge involved factoring a large integer that was the product of two prime numbers, and the prize was $200,000.

Mission/Objective: We have sniffed an unsecured network and found numbers that are used to encrypt very important documents. It seems that those numbers are not always generated using large enough prime numbers. Your mission should you choose to accept it, is to factorize these numbers as fast as possible before the target fixes this bug on their server - so that we can decode the encrypted documents.

• Prime Factorization || How does HTTPS provide security? || [RSA (cryptosystem)](https://en.wikipedia.org/wiki/RSA_(cryptosystem%29) || Python File I/O || Open a File in Python || Reading and Writing to text files in Python

• You can choose the language of your choice, though this project was written in python language
• All the files was interpreted/compiled on Ubuntu 20.04 LTS using python3 (version 3.8.5)
• All files ends with a new line
• The first line of all your files should be exactly #!/usr/bin/env python3
• There is a README.md file, at the root of the folder of the project
• All files are executable
• All coded used the pycodestyle (version 2.8.)

© INNOCENT UDO