TL;DR: since our moduli are coprime, we apply Chinese Remainder Theorem to apply the encrypted message, and can take the regular cube root without solving DLP since the CRT modulus is too large to safely encrypt the flag.

Original writeup (https://bburns.xyz/blog/umassctf2024.html#third-times-the-charm).