Real Eisenstein

cryptohack

Task: ciphertext = floor(16^64 * sum_i ord(flag[i]) * sqrt(PRIMES[i])). Solution: this is an integer-relation problem; build an LLL lattice whose rows are the identity (one per character) plus a heavily weighted column equal to round(16^64 * sqrt(prime_i)), with a final row carrying -ciphertext. LLL finds the short vector whose entries are the printable ASCII codes of the flag (crypto{r34l_t0_23D_m4p}).