Special Purpose Factoring Devices

   A journey from Bicycle to Quantum Computers

Computational Number Theory Project
Math 583e, University of Washington
Spring 2009

Goal of the project

To survey, analyze and understand the current advancements in the field of special purpose hardware for factoring integers.

 

Contents

Factoring Problem
Overview of the Factoring Problem
Factoring Algorithms
Factoring Hardware

SPDs in Past Machine à Congruences
Lehmer Sieves

Current SPDs Kraitchik's Idea
Morisson-Brillhart
Georgia Cracker
Quasimodo
NFS: Number Field Sieve for Factorization
SPDs for Linear Algebra
SPDs for Relation Collection (Sieving)

SPDs of Future Quantum Computing
Shor's Algorithm for Factorization
Quantum Hardware

Summary Concluding remarks
Acknowledgements

References  

 

  Next: Factoring Problem >>