Use the big integer class from c++ please! Not long long!

Implement Fermat test: (yes, you have to implement the test yourself regardless the language you use) Use Fermat's test to generate two large prime numbers (p, q), each should have a size > = 512 bits: Save p and q in a file named p_q. txt (one integer per line): Use extended Euclidean algorithm to generate two pairs of keys: (e, n), (d, n), where n MUST be at least 1024 bit long. Save the two pairs of keys in two separate files: e_n.txt and d_n.txt (one integer per line)