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
All Student Tools
Find a Mathematics Tutor
Scientific & Complex Expression EvaluatorQuadratic, Cubic & Polynomial Equation SolverSystem of Linear Equations Solver (2×2, 3×3, N×N)Fraction, Ratio, GCD/LCM & Percentage Step-by-Step SolverLogarithm, Exponent & Radical SimplifierInteractive Unit Circle & Trigonometry Explorer