Cybersecurity · Postgraduate · Public-key cryptanalysis

RSA cryptanalysis.

RSA is only as strong as its parameters. Each scenario generates a real, deliberately weak key, then recovers the private key or plaintext with the matching attack — Fermat factorization, Wiener's continued-fraction attack on a small private exponent, the common-modulus attack via Bézout coefficients, and the low-exponent e-th root. Every step is genuine BigInt number theory, computed here.

Select a scenario and press Generate & break. The attack runs on a freshly generated vulnerable key.