Montgomery multiplication in number bases that are a power of 2, like binary, hexadecimal, byte-wise etc. Without and with Karatsuba's algorithm to speed up critically large multiplications.
(The project is not meant for practical critical cryptographical purposes.)