This short presentation has some notes on factoring on the Web prepared by Jim Cowie from material from Lenstra and Leyland |
Also a summary of key features of Fafner as a World Wide Computing System |
Go to http://http.npac.syr.edu/factoring.html for a full description and pointers to other collaboraters and further instructions on how to get your software and get started on breaking the Bank of England |
We describe why RSA security status is equivalent to factoring large numbers into two large primes |
A very handwavy description is given of the strategy to find factors with the GNFS -- Generalized Number Field Sieve and its predecessors |
001 Factoring on the Web A Prototype of WebWork Pervasive Implementation of HPCC 002 Abstract of Supercomputing 95 Fafner Presentation 003 Key Features of FAFNER/WebWork Dec 4,1995 -- I 004 Key Features of FAFNER/WebWork Dec 4,1995 -- II 005 Key Features of FAFNER/WebWork Dec 4,1995 -- III 006 RSA: Public Key Cryptosystem 007 How hard is Factoring the Public Modulus? 008 General Number Field Sieve -- GNFS: 009 Sieving (RSA-129 and MPQS, RSA-130 and GNFS) 010 BASIC OBSERVATIONS AND TERMS 011 SIEVING THE Q-INTERVAL 012 Extracting The Relations 013 FIRST Backend Processing STAGE GRAPH REDUCTION 014 SECOND Backend Processing STAGE GRAPH REDUCTION 015 Notes on Current -- Dec 2 -- Status