cryptohard
RSA?
grodno_new_year_2026
Task: RSA with primes of the form p = x^2 + 123*y^2 generated using small multipliers. Solution: CM-ECM attack using Hilbert class polynomial and quotient ring arithmetic to factor n.
$ ls tags/ techniques/
cm_ecmquotient_ring_arithmeticmontgomery_ladderx_only_multiplication
🔒
Permission denied (requires tier.pro)
Sign in to access full writeups
Create a free account with GitHub, then upgrade to Pro.
$ssh [email protected]