|
In mathematics, the RSA numbers are a set of large semiprimes (numbers with exactly two prime factors) that are part of the RSA Factoring Challenge. The challenge was to find the prime factors but it was declared inactive in 2007.〔RSA Laboratories, (The RSA Factoring Challenge ). Retrieved on 2008-03-10.〕 It was created by RSA Laboratories in March 1991 to encourage research into computational number theory and the practical difficulty of factoring large integers. RSA Laboratories published a number of semiprimes with 100 to 617 decimal digits. Cash prizes of varying size were offered for factorization of some of them. The smallest RSA number was factored in a few days. Most of the numbers have still not been factored and many of them are expected to remain unfactored for many years to come. , 18 of the 54 listed numbers have been factored: the 17 smallest from RSA-100 to RSA-704, plus RSA-768. The RSA challenge officially ended in 2007 but people are still attempting to find the factorizations. According to RSA Laboratories, "Now that the industry has a considerably more advanced understanding of the cryptanalytic strength of common symmetric-key and public-key algorithms, these challenges are no longer active."〔RSA Laboratories, (The RSA Factoring Challenge FAQ ). Retrieved on 2008-03-10.〕 Some of the smaller prizes had been awarded at the time. The remaining prizes were retracted. The first RSA numbers generated, from RSA-100 to RSA-500, were labeled according to their number of decimal digits. Later, beginning with RSA-576, binary digits are counted instead. An exception to this is RSA-617, which was created before the change in the numbering scheme. The numbers are listed in increasing order below. ==RSA-100== RSA-100 has 100 decimal digits (330 bits). Its factorization was announced on April 1, 1991 by Arjen K. Lenstra.〔(【引用サイトリンク】title=RSA Honor Roll )〕 Reportedly, the factorization took a few days using the multiple-polynomial quadratic sieve algorithm on a MasPar parallel computer.〔(【引用サイトリンク】Brandon Dixon and Arjen K. Lenstra">url=http://www.springerlink.com/link.asp?id=jdeqqpgku2xk3pve )〕 The value and factorization of RSA-100 are as follows: RSA-100 = 15226050279225333605356183781326374297180681149613 80688657908494580122963258952897654000350692006139 RSA-100 = 37975227936943673922808872755445627854565536638199 × 40094690950920881030683735292761468389214899724061 It takes four hours to repeat this factorization using the program (Msieve ) on a 2200 MHz Athlon 64 processor. The number can be factorised in 72 minutes on overclocked to 3.5 GHz Intel Core2 Quad q9300, using (GGNFS ) and (Msieve ) binaries running by (distributed version of the factmsieve Perl script ).〔(【引用サイトリンク】title=Distributed version of the FactMsieve Perl script )〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「RSA numbers」の詳細全文を読む スポンサード リンク
|