RSA

Builds an RSA key step by step from two primes (n = pq, φ(n), d = e⁻¹ mod φ(n)) and encrypts as m^e mod n, without the padding of PKCS #1 (RFC 8017). The Attack tab breaks weak keys as Boneh's survey (1999) sets out: factoring, Wiener's small d, a shared prime, Håstad's broadcast, a common modulus, a message too small. Rivest, Shamir and Adleman published RSA in 1978.

• R. L. Rivest, A. Shamir and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Communications of the ACM 21 (2), 1978, pp. 120–126
• RFC 8017, PKCS #1: RSA Cryptography Specifications Version 2.2 (2016)
• Dan Boneh, “Twenty Years of Attacks on the RSA Cryptosystem”, Notices of the AMS 46 (2), 1999, pp. 203–213