84 students online
WhatsApp (24/7)

Number Theory, Modular Arithmetic & RSA Cryptography Lab

Calculate Extended Euclidean GCD Bézout coefficients, modular inverses, Euler’s totient φ(n), Chinese Remainder Theorem systems, and interactive RSA key generation.

Run Extended Euclidean Bézout steps, modular inverse a⁻¹ mod m, fast modular exponentiation, Euler’s totient φ(n), Chinese Remainder Theorem, and live RSA encryption/decryption.

Related Academic Tools