# How to attack RSA with 13 primes

Could give me method to attack RSA when N decomposes into multiple primes And this is the topic N = 18086135173395641986123054725350673124644081001065528104355398467069161310728333370888782472390469310073117314933010148415971838393130403883412870626619053053672200815153337045022984003065791405742151350233540671714100052962945261324862393058079670757430356345222006961306738393548705354069502196752913415352527

e = 9074407119435549226216306717104313210750146895081726439798095976354600576814818348656600684713830051655944443364224597709641982342039946659987121376590618828822446965847273448794324003758131816407702456966504389655568712152599077538994030379567217702587542326383955580601916478060973206347266442527564009737910

You can decode it?

• $N$ decomposes to $42$ primes, not $13$. – Meysam Ghahramani Apr 17 '18 at 11:10

First, factor N, e.g. using trial division or Pollard's rho. Next, compute the decryption exponent, or use the method described in this answer to the question “RSA enc/decryption with multiple prime modulus using CRT”.