Inspired by Professor Looper at UIC, who instructed my amazing Math 215 course.
This implementation uses only the C++ STL and Boost Multiprecision integers. In this branch (and main), I only used boost::multiprecision::cpp_int for large integer addition, subtraction, multiplication, division, and modulo. I implemented the Rabin Miller primality test, modular exponentiation, and modular multiplicative inverse calculation myself.
Try It Online With Web Assembly Now here!
This online version of my RSA implementation runs entirely in your browser, client-side, with Web Assembly and a bit of Javascript I wrote.
It uses code from the emscripten branch of this repository, which is (you guessed it) compiled with emscripten.