The RSA algorithm involves four steps: key generation, key distribution, encryption, and decryption.

A basic principle behind RSA is the observation that it is practical to find three very large positive integers e$,$ d$,$ and n$,$ such that with modular exponentiation for all integers $x($with $(x^e{)}^d-=x(modn),E(x)=x^e(modn),D(E(x))=E(x{)}^d$modnenm$0x$

Implement an RSA cipher cracker that should be able to crack simple RSA decryptions.

Your implementation should, given different key pairs of $(e,n),$ be able to compute $d,$ and decrypt any given ciphertext.

You may assume that $n<65536.$

Hint: Think of the four steps of the RSA algorithm from the start.