Description: 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).
To Search:
File list (Check if you may need any files):
Fermat_rsakey.cpp
RSAkey.txt
Download