From Fibonacci and Base-12 Factors to Brent Factors课件.ppt

How 150 factorizations completed 53 ECM 51 SNFS 43 MPQS 2 P?1/FFT (Silverman) 1 GNFS (Kleinjung) ----- 150 Many had earlier ECM or P?1/FFT factor. 精品文档 Sizes of non-largest Fibonacci factors missed in 1986 23 p21-p24 44 p25-p29 35 p30-p34 31 p35-p39 17 p40-p44 10 p45-p49 34 higher ----- 194 精品文档 Fibonacci Contributors 1988-2003 Richard Brent Nicolas Daminelli Marije Elkenbracht-Huizing Jens Franke Sean Irvine Thorsten Kleinjung Joe Leherbauer Mark Manasse (MPQS network) Robert Silverman Thomas Sosnowski I used systems at Unisys, UCLA, Oregon State, CWI, SARA. 精品文档 2003 -- Time to Switch Tables Cunningham table has factors of bn ± 1 for b = 2, 3, 5, 6, 7, 10, 11, 12. Had worked on this intermittently since 1984. Brent table has higher bases. Old August,1999 copy had 1224 composites. Factors of bn ± 1 where 13 ? b ? 29 and bn 10255, or 30 ? b ? 99 and n ? 100. Too many “easy” SNFS (difficulty circa 10110). Experienced labor overload in 1999. 精品文档 2003 Cunningham Base-12 Table 66 composite 12n ± 1 where n ? 300. 13 composite Aurifeuillians for 12n + 1 where n ≡ 3 (mod 6) and n 600. Total 79 composites March, 2003. 35 composites as of June, 2006. First hole advanced from 12,179? to 12,227+. 精品文档 33 Base-12 done by SNFS 489L, 489M, 507M, 519L, 543L, 549M, 555L (Leherbauer), 561M, 573L, 579L, 579M, 591M, 597M 179?, 193?, 197? (NFSNET), 199?, 215?, 235?, 267?, 297? 202+, 206+, 208+, 209+, 214+, 217+, 218+, 238+, 242+, 282+, 288+, 300+ Larger exponents divisible by 3, 5, 7, or 11. Easiest SNFS left have difficulty 12212 for 265+ (degree 4) and 12222 for 259+ (degree 6). 精品文档 Don’t Neglect ECM 12,242+ sieving estimated to take over six calendar months (m = 1222 + 12?22). Meanwhile (mid-2005) Bruce Dodson finds record-size factors using new GMP-ECM 6.0.1. Interrupted SNFS runs to run 5000 ECM curves with p50 parameters. Bruce Dodson had run many curves too. ECM was unsuccessful. 12,242+ factored as p50.p159 (