Introduction - If you have any usage issues, please Google them yourself
Read from the RSAkey.txt RSA key, shaped like a large integer n = pq (p and q are prime numbers), using Fermat factorization method, decomposition, output decomposition results and time-consuming ( seconds).