Category: cryptography

At first glance this looks like a standard ECDLP setup: you get prime $p$, coefficient $a$, an $x$-coordinate for a “generator” $G$, and an $x$-coordinate for a public key $Q$ where:

This is a simple RSA crypto challenge that becomes instantly solvable because the same plaintext (the flag) is encrypted many times using a **small public exponent**.

Comprehensive overview of RSA, its origins, modern variations and optimizations, and where things can go wrong (Part 1).

Comprehensive