Check out the [Common Modulus 1 Writeup](https://theromanxpl0it.github.io/ctf_codeblue2017/common1/) first!

This is a common modulus attack + unpadded message with small exponent.
Basically we can take the square root of the result of the common modulus attack.

Check out the full writeup at [https://theromanxpl0it.github.io/ctf_codeblue2017/common2](https://theromanxpl0it.github.io/ctf_codeblue2017/common2/)

```python
from binascii import unhexlify
import string
def solve(e1, e2, n, m1, m2):
d, x, y = xgcd(e1, e2)
c = (pow(m1, x, n) * pow(m2, y, n)) % n
print unhexlify(hex(long(pow(long(c), 1/3)))[2:-1])
```

Original writeup (https://theromanxpl0it.github.io/ctf_codeblue2017/common2/).