| R. P. Brent, P. Montgomery & H. te Riele,, Factorizations of Cunningham numbers with bases 13 to 99: Millenium edition, Report PRG TR-14-00, Oxford University Computing Laboratory, Oxford, UK, December 2000. |
....long and require about 62 times as much space, or about 3.3Gbytes per sieve processor. If one tries to use an out of core siever, it slows the computations down considerably. 7. Numerical Results The author has factored hundreds of numbers from the Cunningham project [7] and from its extensions [4]. This section gives suggested choices, as a function of the size of the number being factored, for the algorithm parameters. These have been found to work well on Pentium based processors. For other processors, with di#erent cache sizes and instruction sets, these choices may not be optimal. M = ....
R. P. Brent, P. Montgomery & H. te Riele,, Factorizations of Cunningham numbers with bases 13 to 99: Millenium edition, Report PRG TR-14-00, Oxford University Computing Laboratory, Oxford, UK, December 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC