# [카테고리:] Cryptography

• ## Differential Cryptoanalysis

Presentation on my univ lol 🐯 Here is the paper which I saw for presentation 🙂 If I solve CTF problems related to difference analysis later, I could add posts here XD.

• ## Factoring with Gaussian Integer

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,…

Read More →: Factoring with Gaussian Integer
• ## Mapping points into independent Group

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…

Read More →: Mapping points into independent Group
• ## Factoring N by associated prime factors

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…

Read More →: Factoring N by associated prime factors
• ## Cracking Python Random Module

We often see Python random modules in CTF and other open sources. It is very useful if used well, but at the same time it has serious vulnerabilities (such as predicting random value). Because of the algorithm named Mersenne Twister used in python random module. Before we begin, I would like to inform you that…

Read More →: Cracking Python Random Module