A heavily-commented, didactic implementation of batched modular exponentiation — the operation base^exp mod n that is the entire computational core of RSA and Diffie-Hellman — in CUDA C++, built as ...

Reversible circuits for modular multiplication Cx%M with x < M arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus ...