cryptoeasy

DLP Easy

spbctf

Task: Solve ECDLP on small curve y² = x³ - 3x + 1 mod 257, find secret scalar d where Q = d*P. Solution: Brute force all possible d values (1 to 251) since curve order is small prime.

$ ls tags/ techniques/
brute_forceeccdlpdiscrete_logarithm
brute_force_dlpsmall_curve_enumeration
🔒

Permission denied (requires tier.pro)

Sign in to access full writeups

Create a free account with GitHub, then upgrade to Pro.

$ssh [email protected]