TetCTF 2021  Unimplemented
The Challenge
The description of the challenge was:
` “A new public key encryption algorithm is being invented, but the author is not quite sure how to implement the decryption routine correctly. Can you help him?” `
The challenge was primarily to analyze the Python implementation of a public key encryption algorithm whose decryption routine had not yet been implemented and find a way to do so to recover the encrypted flag.
The algorithm
The algorithm is based on the well known RSA cryptosystem, but it has two major differences:

the first one is that instead of using simple integer numbers, it uses Gaussian integers, i.e. complex numbers where both real and imaginary parts are integer values.

the second is that the modulus N is calculated as \(P^{2}Q^{2}\) instead of simply PQ.
The encryption function was as follows:
As we can see, the plain text is filled so that its size (in bits) is of the same order of magnitude as the private key. Then the text is divided in half, and each half is converted into a numerical value that is then used to form a complex number where the real part is the first half and the imaginary part is the second one.
Since complex numbers are used, the code includes a function for multiplication and modular exponentiation of such numbers. Nevertheless, the encryption process occurs in the same way as in RSA: given a private key (e, N) and a plain text message M, the cipher text C is calculated as \(M^{e}\mod N\).
In this algorithm, the exponent e is fixed as 65537 and both the modulus N and the constants P and Q are present at the end of the file as comments, so all we need to do is implement the decryption function. Based on similarities with RSA, we can assume that the decryption process should also look at least partially similar.
Decryption process
In RSA, decryption would be done as follows:

Calculate \(\phi(N)=(P1)(Q1)\)

Calculate \(d=invmod(e,\phi(N))\)

Calculate \(m=c^{e}\mod N\)
Since N is defined as \(P^{2}Q^{2}\) intead of just \(PQ\), we need to figure out the correct way to calculate \(\phi(N)\) (also known as Euler’s totient function ) for this group of Gaussian integers.
To solve this we can start with the definition of \(\phi\). Given \(x=p_{1}{}^{r_{1}}p_{2}{}^{r_{2}}\ldots p_{k}{}^{r_{k}}\), where \(p_{i}\) is the ith prime factor of x and \(r_{i}\) is the number of times x can be divided by such factor, we have that
\[\phi(x)=p_{1}^{r_{1}1}(p_{1}1)p_{2}^{r_{2}1}(p_{2}1)\ldots p_{k}^{r_{k}1}\]By the Fundamental Theorem of Arithmetic, \(\phi(x)\) can also be written as:
\[\phi(x)=x(1\frac{1}{p_{1}})(1\frac{1}{p_{2}})(1\frac{1}{p_{3}})\ldots(1\frac{1}{p_{k}})\]As the totient function is multiplicative, i.e. \(\phi(xy)=\phi(x)\phi(y)\), we can write \(\phi(N)\) as
\[\phi(N)=\phi(P^{2})\phi(Q^{2})\]And so, we have
\[\phi(N)=P^{2}(1\frac{1}{P})Q^{2}(1\frac{1}{Q})\]Easy, right? Wrong… because here comes the real problem: we are not dealing with simple integers, but with Gaussian Integers! Remember that both P and Q are complex numbers with an imaginary part equal to 0.
Luckily, there is a (relatively) simple way to generalize Euler’s totient to Gaussian integers. And it consists in using a variantion of the previous equation which uses a norm function \(\eta\) defined as \(\eta(\alpha)=a^{2}+b^{2}\) where a and b are the real and imaginary parts of \(\alpha\), respectively. So our new totient function is:
\[\phi(x^{k})=\eta(x)^{k}(1\frac{1}{\eta(x)})\]By applying this variation, we can calculate \(\phi(N)\) using
\[\phi(P^{2})=\eta(P)^{2}(1\frac{1}{\eta(P)})\] \[\phi(Q^{2})=\eta(Q)^{2}(1\frac{1}{\eta(Q)})\] \[\phi(N)=\phi(P^{2})\phi(Q^{2})\] \[\phi(N)=\eta(P)^{2}(1\frac{1}{\eta(P)})\eta(Q)^{2}(1\frac{1}{\eta(Q)})\]Using this we can find
\[\phi(N)=(P^{4}P^{2})(Q^{4}Q^{2})\]Decryption routine
Having calculated \(\phi(N)\)^{1}, the rest of the decryption routine can be implemented as it would be in RSA. So, our decrypt function would look something like:
And that’s all, folks.

can be reduced to \(\phi(N)=(P^{3}P)(Q^{3}Q)\) with the same effect. ↩