*** A Classical Introduction to Cryptography - Exercise Book ***

** Challenge 1: A (weak) 1024-bit RSA modulus **

The objective of this challenge is quite simple. You are given an RSA
modulus n of 1024 bits, which is the product of two primes of about
512 bits each. The goal of this challenge is to factorize n, i.e., to
recover the two primes numbers p and q such that n = p*q. The exact
value of n is:

n=140890630424640121606246148718819221161351690889799121621132723825693803069277183063881460585142021171171536963571632779454623307296123592714291311635715739135019802021362636016116629100124159282596120548199967947273763833803565196994145960524131171966572660984528682933863362141868803533095970746236178406199

If you manage to solve this challenge, send your result to the
email available from the website of the book

      www.intro-to-crypto.info

so that your name appears in the Hall of Fame!

Good Luck!