RSA TL;DR: n = pq; encryption is c = m^e mod n. CTF attacks: small e, common modulus, Wiener, Coppersmith, Hastad. Stub — to be filled in. What it is TODO Preconditions / where it applies TODO Technique TODO Detection and defence TODO References https://github.com/RsaCtfTool/RsaCtfTool