➗ Modular Arithmetic Calculator

(a op b) mod n — All operations wrap around modulus n

Operation

Modulus (n)

🔢 Extended Euclidean Algorithm (GCD)

gcd(a,b) = a×x + b×y — finds Bézout coefficients

🔄 Modular Inverse Calculator

a⁻¹ mod n via Fermat's Little Theorem: a^(n-2) mod n (n prime) or Extended Euclidean

Modulus (n, prime)

🔐 Discrete Logarithm Problem Demo

Find x where g^x ≡ h (mod p) — foundation of ECDLP security

Base (g)

Target (h)

Prime (p)

👶 Baby-Step Giant-Step Visualizer

Splits search into √p baby steps + √p giant steps, reducing O(p) to O(√p) time complexity.

j (Baby Step)	g^j mod p	i (Giant Step)	h·g^(-im) mod p

💪 Big Integer Arithmetic (Native BigInt)

JavaScript BigInt handles arbitrary precision integers — essential for 256-bit crypto keys

Big Number A

Operation

Big Number B

Note: First value defaults to secp256k1 field prime (2²⁵⁶ - 2³² - 977)