Factoring, RSA, Discrete-Logarithm and Diffie-Hellman

Tweet Problems like addition, multiplication, modular arithmetic, exponentiation can be solved in polynomial time, so they are seen as easy problem. Factoring a random number seems not hard, because 50% of the time, random number is even; 1/3 of the time, random number is divisible by 3. But the problem of factoring some special numbers … Continue reading Factoring, RSA, Discrete-Logarithm and Diffie-Hellman