Ihave stumbled across rsa challenge in ctf where the public exponent isn't coprime with euler's totient is there anyway to determine the ciphertext