# Factorize RSA knowing several N and E

I did a CRT challenge yesterday and theres one problem I was unable to solve, probably due to my lack of understanding advanced crypto math.

Its about RSA. There are ten given pairs of N and E (modulo and exponent). E is always the standard exponent 10001 (hex). N is a 2048 bit number.

For the deterministic algorithm, see $\:$ www.math.dartmouth.edu/~carlp/aks041411.pdf . $\hspace{.7 in}$ –  Ricky Demer Dec 7 '12 at 22:38