B. Acknowledgements for the Second Edition.

Back

We wish to thank the following people who have contributed to the Second

Edition:

New factors of numbers in the main tables were discovered by A. O. L. Atkin,

R. J. Baillie, R. P. Brent, J. A. Davis, H. Dubner, D. B. Holdridge, W. Keller,

Y. Kida, K. McCurdy, P. L. Montgomery, W. Niebuhr, N.W. Rickert, R. Silverman,

J. W. Smith, H. Suyama, H. J. J. te Riele, M. C. Wunderlich and SSW. The new

factors of Fermat numbers were found by R. J. Baillie, G. B. Gostin, W. Keller and

H. Suyama.

J.W. Tanner wrote a program which checked the new factors and inserted them

into the tables. M. Senn wrote a program to format the tables. The new prime

proofs were supplied by A. O. L. Atkin, A. K. Lenstra, A. Odlyzko, H. Suyama,

D. Tormey and SSW.

The new results of the second edition required hundreds of thousands of hours

of computer time. We are grateful to the directors and sta_s of the following computer

centers which provided this time: Australian National University Computer

Centre; Bell Telephone Laboratories, Murray Hill; Dutch Organization for the Advancement

of Pure Research and Control Data Corporation, Netherlands; MITRE

Corporation's research computer facility and its Bedford Computer Center; MPP

computer facility at Goddard Space Flight Center, Greenbelt, MD; Purdue University

Department of Computer Sciences; Rechenzentrum der Universitat Hamburg;

Sandia National Laboratories, Albuquerque, NM; Supercomputing Research Center,

Lanham, MD and their Cray hardware engineers; Unisys Research and Development

Computer Facility, Santa Monica and Advanced Research Center, Huntsville;

University of Georgia O_ce of Computing and Information Services; University

of Illinois Computer-Based Education Research Laboratory; and the University of

Illinois at Chicago Computer Center.

SSW gratefully acknowledges the support of the National Science Foundation

in the preparation of this edition and of the annual updates.

IV C REFERENCES FOR THE SECOND EDITION lxxxvi

References

The _rst edition had references 1-118; they appear in III E.

201. L. M. Adleman, Carl Pomerance and R. S. Rumely, On Distinguishing Prime Numbers from

Composite Numbers, Ann. of Math. 117 (1983), 173{206, MR 84e:10008.

202. Eric Bach, Lenstra's Algorithm for Factoring with Elliptic Curves, Expos_e, Computer Sciences

Department, University of Wisconsin, Madison, February, 1985.

203. W. Bosma, Primality Testing Using Elliptic Curves, Report 85{12, Mathematisch Instituut,

Universiteit van Amsterdam, 1985.

204. R. P. Brent, An Improved Monte Carlo Factorization Algorithm, BIT 20 (1980), 176{184,

MR 82a:10007.

205. R. P. Brent, Some Integer Factorization Algorithms Using Elliptic Curves, Research Report

CMA-R32-85, The Australian National University, Canberra, September, 1985.

206. R. P. Brent and J. M. Pollard, Factorization of the Eighth Fermat Number, Math. Comp.

36 (1981), 627{630, MR 83h:10014.

207. John Brillhart, Fermat's Factoring Method and its Variants, Congressus Numerantium 32

(1981), 29{48, MR 84f:10009.

208. John Brillhart, Peter L. Montgomery, and Robert D. Silverman, Tables of Fibonacci and

Lucas Factorizations, Math. Comp. 50 (1988), 251{260, MR 89h:11002.

209. Duncan A. Buell, The Expectation of Success Using a Monte Carlo Factoring Method|Some

Statistics on Quadratic Class Numbers, Math. Comp. 43 (1984), 313{327, MR 85k:11068.

210. D. V. Chudnovsky and G. V. Chudnovsky, Sequences of Numbers Generated by Addition

in Formal Groups and New Primality and Factorization Tests, Research report RC 11262

(#50739), IBM Research Center, Yorktown Heights, July, 1985.

211. H. Cohen and A. K. Lenstra, Implementation of a New Primality Test, Math. Comp. 48

(1987), 103{121, MR 88c:11080.

212. H. Cohen and H. W. Lenstra, Jr., Primality Testing and Jacobi Sums, Math. Comp. 42

(1984), 297{330, MR 86g:11078.

213. D. Coppersmith, A. M. Odlyzko and R. Schroeppel, Discrete Logarithms in GF(p), Algorithmica

1 (1986), 1{15, MR 87g:11167.

214. J. A. Davis and D. B. Holdridge, Factorization Using the Quadratic Sieve Algorithm, Advances

in Cryptology, Proceedings of Crypto 83, David Chaum, ed., Plenum Press, New

York, 1984, pp. 103{113, MR 86j:11128.

215. J. A. Davis and D. B. Holdridge, Most Wanted Factorizations Using the Quadratic Sieve,

Sandia National Laboratories Report SAND 84-1658, August, 1984.

216. J. A. Davis, D. B. Holdridge and G. J. Simmons, Status Report on Factoring (at the Sandia

National Labs), Advances in Cryptology, Proceedings of EUROCRYPT 84, T. Beth, N. Cot

and I. Ingemarsson, eds., Springer-Verlag Lecture Notes in Computer Science vol. 209, 1985,

pp. 183{215, MR 87f:11105.

217. John D. Dixon, Factorization and Primality Tests, Amer. Math. Monthly 91 (1984), 333{

352, MR 87c:11121a.

218. H. Dubner and R. Dubner, The Development of a Powerful, Low-Cost Computer for Number

Theory Applications, J. Rec. Math. 18 (1986), 81{86.

219. J. L. Gerver, Factoring Large Numbers with a Quadratic Sieve, Math. Comp. 41 (1983),

287{294, MR 85c:11122.

220. S. Goldwasser and J. Kilian, Almost All Primes Can Be Certi_ed Quickly, Proc. Eighteenth

Annual ACM Symp. on the Theory of Computing (STOC), Berkeley, May 28-30, 1986,

316{329.

221. G. B. Gostin and P. B. McLaughlin, Six New Factors of Fermat Numbers, Math. Comp. 38

(1982), 645{649, MR 83c:10003.

222. G. McC. Haworth, Primality Testing Mersenne Numbers (II), Abstract 86T-11-57, Abstr.

Amer. Math. Soc. 7 (1986), 224{225.

223. Guy Haworth, Mersenne Numbers, Reading, Berkshire, 1987 (privately published notes).

224. Wilfrid Keller, Factors of Fermat Numbers and Large Primes of the Form k:2n + 1, Math.

Comp. 41 (1983), 661{673, MR 85b:11117.

225. A. K. Lenstra and H. W. Lenstra, Jr., Algorithms in Number Theory, Technical Report 87-

008, The University of Chicago, May, 1987.

lxxxvii IV C REFERENCES FOR THE SECOND EDITION

226. H. W. Lenstra, Jr., Primality Testing Algorithms (after Adleman, Rumely and Williams),

S_eminaire Bourbaki, Springer-Verlag Lecture Notes in Mathematics vol. 901, Berlin-New

York, 1981, pp. 243{257, MR 83g:10002.

227. H. W. Lenstra, Jr., Galois Theory and Primality Testing, Orders and Their Applications, I.

Reiner and K. Roggenkamp, eds., Springer-Verlag Lecture Notes in Mathematics, vol. 1142,

Heidelberg, 1985, pp. 169{189, MR 87g:11171.

228. H. W. Lenstra, Jr., Factoring Integers with Elliptic Curves, Ann. of Math. 126 (1987),

649{673, MR 89g:11125.

229. Walter M. Lioen, Dik T. Winter and Herman J. J. te Riele, Factoring with the Quadratic

Sieve on Large Vector Computers, J. Comput. Appl. Math. 27 (1989 pages 267{278), MR

90h:11111.

230. Peter L. Montgomery, Modular Multiplication without Trial Division, Math. Comp. 44

(1985), 519{521, MR 86e:11121.

231. Peter L. Montgomery, Speeding the Pollard and Elliptic Curve Methods of Factorization,

Math. Comp. 48 (1987), 243{264, MR 88e:11130.

232. Thorkil Naur, Integer Factorization, Report DAIMI PB-144, Matematisk Institut, Aarhus

Universitet, May, 1982.

233. Thorkil Naur, New Integer Factorizations, Math. Comp. 41 (1983), 687{695, MR 85c:11123.

234. A. M. Odlyzko, Discrete Logarithms in Finite Fields and their Cryptographic Signi_cance,

Advances in Cryptology, Proceedings of EUROCRYPT 84, T. Beth, N. Cot and I. Ingemarsson,

eds., Springer-Verlag Lecture Notes in Computer Science vol. 209, 1985, pp. 224{314,

MR 87g:11022.

235. D. Parkinson and M. Wunderlich, A Compact Algorithm for Gaussian Elimination over

GF(2) Implemented on Highly Parallel Computers, Parallel Computing 1 (1984), 65{73.

236. Carl Pomerance, Recent Developments in Primality Testing, Math. Intelligencer 3 (1981),

97{105, MR 83h:10015.

237. Carl Pomerance, Analysis and Comparison of Some Integer Factoring Algorithms, Computational

Methods in Number Theory, Part 1, H. W. Lenstra, Jr. and R. Tijdeman, eds.,

Math. Centrum Tract 154, Amsterdam, 1982, pp. 89{139, MR 84i:10005.

238. Carl Pomerance, The Quadratic Sieve Factoring Algorithm, Advances in Cryptology, Proceedings

of EUROCRYPT 84, T. Beth, N. Cot and I. Ingemarsson, eds., Springer-Verlag

Lecture Notes in Computer Science vol. 209, 1985, pp. 169{182, MR 87d:11098.

239. Carl Pomerance, J. W. Smith and Randy Tuler, A Pipe-line Architecture for Factoring Large

Integers with the Quadratic Sieve Algorithm, SIAM J. Comput. 17 (1988), 387{403.

240. Carl Pomerance, J. W. Smith and S. S.Wagsta_, Jr., New Ideas for Factoring Large Integers,

Advances in Cryptology, Proceedings of Crypto 83, David Chaum, ed., Plenum Press, New

York, 1984, pp. 81{85, MR 86f:94001.

241. Carl Pomerance and S. S. Wagsta_, Jr., Implementation of the Continued Fraction Integer

Factoring Algorithm, Congressus Numerantium 37 (1983), 99{118, MR 85c:11124.

242. Hans Riesel, Prime Numbers and Computer Methods for Factorization, Birkhauser, Boston,

1985, MR 88k:11002.

243. Hans Riesel, Modern Factorization Methods, BIT 25 (1985), 205{222, MR 87c:11122.

244. W. G. Rudd, Duncan A. Buell and Donald M. Chiarulli, A High Performance Factoring

Machine, Proceedings of the Eleventh International Symposium on Computer Architecture,

1984.

245. Robert Rumely, Recent Advances in Primality Testing, Notic. Amer. Math. Soc. 30 (1983),

475{477, MR 85b:11122.

246. C.-P. Schnorr and H. W. Lenstra, Jr., A Monte Carlo Factoring Algorithm with Linear

Storage, Math. Comp. 43 (1984), 289{311, MR 85d:11106.

247. Robert D. Silverman, The Multiple Polynomial Quadratic Sieve, Math. Comp. 48 (1987),

329{339, MR 88c:11079.

248. Robert D. Silverman, Parallel Implementation of the Quadratic Sieve, The Journal of Supercomputing

1 (1988), 273{290.

249. J. W. Smith and S. S. Wagsta_, Jr., An Extended Precision Operand Computer, Proceedings

of the Twenty-First Southeast Region ACM Conference (1983), 209{216.

250. Hiromi Suyama, Searching for Prime Factors of Fermat Numbers with a Microcomputer, bit

(Tokyo) 13 (1981), 240{245 (in Japanese), MR 82c:10012.

IV C REFERENCES FOR THE SECOND EDITION lxxxviii

251. Hiromi Suyama, The Cofactor of F15 is Composite, Abstr. Amer. Math. Soc. 5 (1984),

271{272.

252. Hiromi Suyama, Large Primes and Prime Divisors of Fermat Numbers, bit (Tokyo) 17

(1985), 136{143 (in Japanese).

253. S. S. Wagsta_, Jr. and J. W. Smith, Methods of Factoring Large Integers, Number Theory,

New York, 1984-85, D. V. Chudnovsky, G. V. Chudnovsky, H. Cohn and M. B. Nathanson,

eds., Springer-Verlag Lecture Notes in Mathematics, vol. 1240, Berlin, 1987, pp. 281{303.

254. Douglas H. Wiedemann, Solving Sparse Linear Equations over Finite Fields, IEEE Trans.

Info. Theory 32 (1986), 54{61, MR 87g:11166.

255. H. C. Williams, A p + 1 Method of Factoring, Math. Comp. 39 (1982), 225{234, MR

83h:10016.

256. H. C. Williams, An Overview of Factoring, Advances in Cryptology, Proceedings of Crypto

83, David Chaum, ed., Plenum Press, New York, 1984, pp. 71{80, MR 86f:94001.

257. H. C. Williams and Harvey Dubner, The Primality of R1031, Math. Comp. 47 (1986),

703{711, MR 87k:11141.

258. H. C. Williams and C. D. Patterson, A Report on the University of Manitoba Sieve Unit,

Congressus Numerantium 37 (1983), 85{98, MR 84g:10003.

259. H. C. Williams and M. C. Wunderlich, On the Parallel Generation of the Residues for the

Continued Fraction Factoring Algorithm, Math. Comp. 48 (1987), 405{423, MR 88i:11099.

260. Marvin C. Wunderlich, Factoring Numbers on the Massively Parallel Computer, Advances

in Cryptology, Proceedings of Crypto 83, David Chaum, ed., Plenum Press, New York, 1984,

pp. 87{102, MR 86f:94001.

261. Marvin C. Wunderlich, Implementing the Continued Fraction Factoring Algorithm on Parallel

Machines, Math. Comp. 44 (1985), 251{260, MR 86d:11104.

262. Samuel Yates, Repunits and Repetends, Delray Beach , FL, 1982, MR 83k:10014.

263. Je_ Young and Duncan A. Buell, The Twentieth Fermat Number is Composite, Math. Comp.

50 (1988), 261{263, MR 89b:11012.

Навигация