Editing RSA numbers (section)

==RSA-200==
{{wikinews|Two hundred digit number factored}}
RSA-200 has 200 decimal digits (663 bits), and factors into the two 100-digit primes given below.

On May 9, 2005, F. Bahr, M. Boehm, J. Franke, and T. Kleinjung announced<ref name="announce">[[Thorsten Kleinjung]] (2005-05-09), [http://www.crypto-world.com/announcements/rsa200.txt We have factored RSA200 by GNFS] {{Webarchive|url=https://web.archive.org/web/20080322125316/http://www.crypto-world.com/announcements/rsa200.txt|date=2008-03-22}}. Retrieved on 2008-03-10.</ref><ref>RSA Laboratories, [https://www.emc.com/emc-plus/rsa-labs/historical/rsa-200-factored.htm RSA-200 is factored!]. Retrieved on 2017-01-25.</ref> that they had factorized the number using GNFS as follows:

 RSA-200 = 2799783391122132787082946763872260162107044678695542853756000992932612840010
           7609345671052955360856061822351910951365788637105954482006576775098580557613
           579098734950144178863178946295187237869221823983

 RSA-200 = 3532461934402770121272604978198464368671197400197625023649303468776121253679
           423200058547956528088349
         × 7925869954478333033347085841480059687737975857364219960734330341455767872818
           152135381409304740185467

The CPU time spent on finding these factors by a collection of parallel computers amounted &ndash; very approximately &ndash; to the equivalent of 75<!-- Do NOT change this to 55. Two parts took respectively 55 and 80*3/12=20 years for 75 in total--> years work for a single 2.2 [[GHz]] [[Opteron]]-based computer.<ref name=announce/> Note that while this approximation serves to suggest the scale of the effort, it leaves out many complicating factors; the announcement states it more precisely.