[태그:] crypto

Gaussian Integer is represented as $a + bi$. Simply can think as complex number with integer coefficients. Surprisingly, we can use this Gaussian integer to factorize the numbers. Let’s see some challenges using Gaussian integer. Euclidean RSA – [nullcon CTF] The code is simple enough, just generate the RSA key and make the variables $a,…

Mapping is very very important method. The representative example of mapping is isogeny. Isogeny is defined with mapping function, and other many concept in math uses mapping. Rather than addressing the whole thing in this article, I plan to post with significance to come up with this mindset. The challenge which made me think about…

Factoring N is very very important problem for RSA crypto system. If we could factor N, the crypto system will be cracked and can be easily decrypted. So it is safe to say that the difficulties of RSA encryption systems depend on factorization. In some CTF challenges such as sus – [ImagianryCTF 2023] and cry…