cryptohard

Ralia

ASIS CTF

Task: find three numbers satisfying perfect square sum conditions with prime and bit-length constraints across 19 levels. Solution: parametrize with a=c and b=2m to reduce to a 2D search, then iterate m and a checking primality of z=2m²-3 and x=a²-y.

$ ls tags/ techniques/
diophantine_equationsperfect_squaresprime_searchparametrizationnumber_theoryimo_problemmulti_level
Diophantine equation parametrizationPrime number search with bit length constraintsPerfect square sum conditionsMulti-level challenge automation
🔒

Permission denied (requires tier.pro)

Sign in to access full writeups

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

$ssh [email protected]