Page 16 - Demo_cryptography
P. 16
2.2 Integerfactorizationproblem
One of the most popular public- key encryption algorithm is secure because it is hard to solve the integer factorization problem
• Given a large integer n, find its prime factors p and q, such that n=p*q.
• For example if n=21, it is easy to know that 3*7=21.
• But if n=10403, it is harder to find out that 101*103=10403.
Actividad de aprendizaje
Which are the prime factors of 10006200817? How did you found them?
